Algebraic Coding Theory (No. M-6)

This book concerns state-of-the-art coding and decoding methods. Research reviewed in the book include Berlekamp's algorithm for factoring polynomials (the first significant improvement on a classical mathematical problem in almost two centuries), and Berlekamp's algorithm for decoding Bose- Chaudhuri-Hocquenghem and Reed-Solomon codes. For the past 15 years, this coding algorithm has been used universally in algebraic decoders that correct multiple errors in communications or computer memory systems. Chapters include: Basic Binary Codes; Arithmetic Operations Modulo an Irreducible Binary Polynomial; The Number of Irreducible q-ary Polynomials of Given Degree; The Factorization of Polynomials Over Finite Fields; The Enumeration of Information Symbols in BCH Codes; appendices and references.