This text offers a thorough introduction to the mathematical concepts behind the theory of error-correcting linear codes. Care is taken to introduce the necessary algebraic concepts, for instance the theory of finite fields, the polynomial rings over such fields and the ubiquitous concept of group actions that allows the classification of codes by isometry. The book provides in-depth coverage of important topics like cyclic codes and the coding theory used in compact disc players. The final four chapters cover advanced and algorithmic topics like the classification of linear codes by isometry, the enumeration of isometry classes, random generation of codes, the use of lattice basis reduction to compute minimum distances, the explicit construction of codes with given parameters, as well as the systematic evaluation of representatives of all isometry classes of codes. Up until now, these advanced topics have only been covered in research papers. The present book provides access to these results at a level which is suitable for graduate students of mathematics, computer science and engineering as well as for researchers.

This text offers an introduction to error-correcting linear codes for researchers and graduate students in mathematics, computer science and engineering. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. The relevant algebraic are developed rigorously. Cyclic codes are discussed in great detail. In the last four chapters these isometry classes are enumerated, and representatives are constructed algorithmically.

Linear Codes.- Bounds and Modifications.- Finite Fields.- Cyclic Codes.- Mathematics and Audio Compact Discs.- Enumeration of Isometry Classes.- Solving Systems of Diophantine Linear Equations.- Linear Codes with a Prescribed Minimum Distance.- The General Case.