Applied algebra, algebraic algorithms, and errorcorrecting codes : 12th international symposium, AAECC12, Toulouse, France, June 2327, 1997 : proceedings
 Responsibility
 Teo Mora, Harold Mattson (eds.).
 Imprint
 Berlin ; New York : Springer, 1997.
 Physical description
 1 online resource (x, 352 pages) : illustrations
 Series
 Lecture notes in computer science ; 1255.
Online
More options
Description
Creators/Contributors
 Meeting
 AAECC12 (1997 : Toulouse, France)
 Contributor
 Mora, Teo.
 Mattson, H. F. (Harold F.), 1930
Contents/Summary
 Bibliography
 Includes bibliographical references and index.
 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 nlinear codes. On repeatedroot cyclic codes and the twoway chain condition. Exponentiation in finite fields: Theory and practice. Computing minimumlink path in a homotopy class amidst semialgebraic obstacles in the plane. Certain selfdual 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 qary image of cyclic codes. The split weight (w L , w R ) enumeration of ReedMuller codes for w L +w R d min. Optimal linear codes of dimension 4 over GF(5). Characterisations of lexicographic sets and simplyconnected 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. Tracefunction on a Galois ring in coding theory. A vector version of the BMS algorithm for implementing fast erasureanderror decoding of onepoint 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.
 (source: Nielsen Book Data)
 Publisher's summary

This book constitutes the strictly refereed proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, AAECC12, 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.
(source: Nielsen Book Data)
Subjects
Bibliographic information
 Publication date
 1997
 Title variation
 AAECC12
 Series
 Lecture notes in computer science ; 1255
 ISBN
 9783540691938 (electronic bk.)
 3540691936 (electronic bk.)
 3540631631
 9783540631637