This book constitutes the strictly refereed proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-12, held in Toulouse, France, June 1997.
The 27 revised full papers presented were carefully selected by the program committee for inclusion in the volume. The papers address a broad range of current issues in coding theory and computer algebra spanning polynomials, factorization, commutative algebra, real geometry, group theory, etc. on the mathematical side as well as software systems, telecommunication, complexity theory, compression, signal processing, etc. on the computer science and engineering side.
Author(s): Alexander Barg (auth.), Teo Mora, Harold Mattson (eds.)
Series: Lecture Notes in Computer Science 1255
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 362
Tags: Coding and Information Theory; Symbolic and Algebraic Manipulation; Numeric Computing; Communications Engineering, Networks; Algorithms; Discrete Mathematics in Computer Science
Minimun distance decoding algorithms for linear codes....Pages 1-14
Efficient multivariate factorization over finite fields....Pages 15-28
On maximal codes in polynomial metric spaces....Pages 29-38
Yet another ideal decomposition algorithm....Pages 39-54
A resultant theory for ordinary algebraic differential equations....Pages 55-65
On repeated-root cyclic codes and the two-way chain condition....Pages 66-77
Exponentiation in finite fields: Theory and practice....Pages 78-87
Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane....Pages 88-113
Certain self-dual codes over ℤ 4 and the odd Leech lattice....Pages 114-129
Order functions and evaluation codes....Pages 130-137
Codes from cocycles....Pages 138-150
A brief tour of split linear programming....Pages 151-163
Elementary approximation of exponentials of Lie polynomials....Pages 164-173
On the q -ary image of cyclic codes....Pages 174-188
The split weight ( w L , w R ) enumeration of Reed-Muller codes for w L + w R <2 d min ....Pages 189-196
Optimal linear codes of dimension 4 over GF (5)....Pages 197-211
Characterisations of lexicographic sets and simply-connected Hilbert schemes....Pages 212-220
An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance....Pages 221-236
Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach....Pages 237-249
Formal duality of linearly presentable codes over a Galois field....Pages 250-262
Trace-function on a Galois ring in coding theory....Pages 263-276
A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes....Pages 277-290
On generalized Hamming weights of codes constructed on affine algebraic sets....Pages 291-310
Some results on regular mappings....Pages 311-320
Extension theorems for linear codes over finite rings....Pages 321-328
Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes....Pages 329-340
....Pages 341-352
