HOME > Detail View

Detail View

Applied algebra, algebraic algorithms and error-correcting codes : 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997 : proceedings

Applied algebra, algebraic algorithms and error-correcting codes : 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997 : proceedings

Material type
단행본
Personal Author
Mora, Teo. Mattson, H. F. (Harold F.), 1930-.
Title Statement
Applied algebra, algebraic algorithms and error-correcting codes : 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997 : proceedings / Teo Mora, Harold Mattson (eds.).
Publication, Distribution, etc
Berlin ;   New York :   Springer,   c1997.  
Physical Medium
x, 352 p. : ill. ; 24 cm.
Series Statement
Lecture notes in computer science,0302-9743 ; 1255
ISBN
3540631631 (pbk. : alk. paper) 9783540631637 (pbk. : alk. paper)
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Error-correcting codes (Information theory) -- Congresses. Algebra -- Data processing -- Congresses. Algorithms -- Congresses.
000 01549camuu2200373 a 4500
001 000045560903
005 20091125153309
008 970605s1997 nyua b 101 0 eng
010 ▼a 97023266
020 ▼a 3540631631 (pbk. : alk. paper)
020 ▼a 9783540631637 (pbk. : alk. paper)
035 ▼a (OCoLC)ocm37109167
035 ▼a (OCoLC)37109167
035 ▼a (KERIS)REF000003840029
040 ▼a DLC ▼c DLC ▼d DLC ▼d 211009
050 0 0 ▼a QA268 ▼b .A35 1997
082 0 4 ▼a 005.7/2 ▼2 22
090 ▼a 005.72 ▼b A111a ▼c 1997
111 2 ▼a AAECC-12 ▼d (1997 : ▼c Toulouse, France)
245 1 0 ▼a Applied algebra, algebraic algorithms and error-correcting codes : ▼b 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997 : proceedings / ▼c Teo Mora, Harold Mattson (eds.).
246 3 0 ▼a AAECC-12
260 ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c1997.
300 ▼a x, 352 p. : ▼b ill. ; ▼c 24 cm.
490 1 ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 1255
504 ▼a Includes bibliographical references and index.
650 0 ▼a Error-correcting codes (Information theory) ▼v Congresses.
650 0 ▼a Algebra ▼x Data processing ▼v Congresses.
650 0 ▼a Algorithms ▼x Congresses.
700 1 ▼a Mora, Teo.
700 1 ▼a Mattson, H. F. ▼q (Harold F.), ▼d 1930-.
830 0 ▼a Lecture notes in computer science ; ▼v 1255.
945 ▼a KINS

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.72 A111a 1997 Accession No. 121186564 Availability Available Due Date Make a Reservation Service B M

Contents information

Table of Contents

Minimun distance decoding algorithms for linear codes.- Efficient multivariate factorization over finite fields.- On maximal codes in polynomial metric spaces.- Yet another ideal decomposition algorithm.- A resultant theory for ordinary algebraic differential equations.- The symmetry group of ? q n in the Lee space and the ? q n-linear codes.- On repeated-root cyclic codes and the two-way chain condition.- Exponentiation in finite fields: Theory and practice.- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane.- Certain self-dual codes over ?4 and the odd Leech lattice.- Order functions and evaluation codes.- Codes from cocycles.- A brief tour of split linear programming.- Elementary approximation of exponentials of Lie polynomials.- On the q-ary image of cyclic codes.- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min.- Optimal linear codes of dimension 4 over GF(5).- Characterisations of lexicographic sets and simply-connected Hilbert schemes.- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance.- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach.- Formal duality of linearly presentable codes over a Galois field.- Trace-function on a Galois ring in coding theory.- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.- On generalized Hamming weights of codes constructed on affine algebraic sets.- Some results on regular mappings.- Extension theorems for linear codes over finite rings.- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes.


Information Provided By: : Aladin

New Arrivals Books in Related Fields