Error-Correcting Linear Codes

Michael Braun ist Journalist und Wirtschaftswissenschaftler. Mehrere Jahre lang Wall-Street-Reporter in New York sowie Chefredakteur des Geldmagazins "Finanzen" in München. Der Autor lebt und arbeitet in Berlin.

The fascinating theory of error-correcting codes is a rather new addition to the list of mathematical disciplines. It grew out of the need to communicate information electronically, and is currently no more than 60 years old. - ing an applied discipline by de?nition, a surprisingly large number of pure mathematical areas tie into Coding Theory. If one were to name just the most important connections, one would start of course with Linear Algebra, then list Algebra and Combinatorics, and further mention Number Theory and - ometry as well as Algebraic Geometry. Being a thorough introduction to the ?eld, this book starts from the very beginning, which is the channel model of communication in the presence of noise. From there, we develop the fundamental concepts of error-correcting codes, like the Hamming metric and the maximum likelihood decoding pr- ciple. After discussing dual codes and simple decoding procedures, this book takes an unusual turn. The standard approach would be to move on from there and introduce either more theory or present standard constructions of codes. The approach taken here is different.

This text offers an introduction to error-correcting linear codes. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. The book is based on the successful German edition.

This text offers an introduction to error-correcting linear codes. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. It is based on the successful German edition. The relevant algebraic concepts like finite fields and group actions 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 with or without a prescribed automorphism group.

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.