Alexander Barg (auth.), Teo Mora, Harold Mattson (eds.)3540631631, 9783540631637
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.
Table of contents :
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
Reviews
There are no reviews yet.