Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Algebraic coding theory / Elwyn Berlekamp.

By: Material type: TextTextPublication details: Singapore : World Scientific, ©2015.Edition: Rev edDescription: xxiv, 474 p. : illustrations ; 24 cmISBN:
  • 9789814635899 (hbk.)
Subject(s): DDC classification:
  • 512 23 B514
Contents:
1. Basic binary codes -- 2. Arithmetic operations modulo -- 3. The number of irreducible q-ary -- 4. The structure of finite fields -- 5. Cyclic binary codes -- 6. The factorization of polynomials over finite fields -- 7. Binary BCH codes for correcting multiple errors -- 8. Nonbinary coding -- 9. Negacyclic codes for the Lee Metric -- 10. Gorenstein-Zierler Generalized Nonbinary BCH codes for the hamming metric -- 11. Linearized polynomials and Affine polynomials -- 12. The enumeration of information symbols in BCH codes -- 13. The information rate of the optimum codes -- 14. Codes derived by modifying or combining other codes -- 15. Other important coding and decoding methods -- 16. Weight enumerators -- Appendices.
Summary: This is the revised edition of Berlekamp's famous book, 'Algebraic Coding Theory', originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field. One of these is an algorithm for decoding Reed-Solomon and Bose-Chaudhuri-Hocquenghem codes that subsequently became known as the Berlekamp-Massey Algorithm. Another is the Berlekamp algorithm for factoring polynomials over finite fields, whose later extensions and embellishments became widely used in symbolic manipulation systems. Other novel algorithms improved the basic methods for doing various arithmetic operations in finite fields of characteristic two. Other major research contributions in this book included a new class of Lee metric codes, and precise asymptotic results on the number of information symbols in long binary BCH codes.Selected chapters of the book became a standard graduate textbook.Both practicing engineers and scholars will find this book to be of great value.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Books ISI Library, Kolkata 512 B514 (Browse shelf(Opens below)) Available 137067
Total holds: 0

Includes bibliographical references and index.

1. Basic binary codes --
2. Arithmetic operations modulo --
3. The number of irreducible q-ary --
4. The structure of finite fields --
5. Cyclic binary codes --
6. The factorization of polynomials over finite fields --
7. Binary BCH codes for correcting multiple errors --
8. Nonbinary coding --
9. Negacyclic codes for the Lee Metric --
10. Gorenstein-Zierler Generalized Nonbinary BCH codes for the hamming metric --
11. Linearized polynomials and Affine polynomials --
12. The enumeration of information symbols in BCH codes --
13. The information rate of the optimum codes --
14. Codes derived by modifying or combining other codes --
15. Other important coding and decoding methods --
16. Weight enumerators --
Appendices.

This is the revised edition of Berlekamp's famous book, 'Algebraic Coding Theory', originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field. One of these is an algorithm for decoding Reed-Solomon and Bose-Chaudhuri-Hocquenghem codes that subsequently became known as the Berlekamp-Massey Algorithm. Another is the Berlekamp algorithm for factoring polynomials over finite fields, whose later extensions and embellishments became widely used in symbolic manipulation systems. Other novel algorithms improved the basic methods for doing various arithmetic operations in finite fields of characteristic two. Other major research contributions in this book included a new class of Lee metric codes, and precise asymptotic results on the number of information symbols in long binary BCH codes.Selected chapters of the book became a standard graduate textbook.Both practicing engineers and scholars will find this book to be of great value.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in