Algebraic Coding Theory

Berlekamp, Elwyn R.

ISBN 10: 0070049033 / ISBN 13: 9780070049031

Published by McGraw-Hill, New York, New York, 1968

About this Item

Octavo in black DJ, xiv, 466 p, b&w illustrations; 24 cm. Algebra, Mathematics. Useful notes included by student. Very gently bumped corners, very mild rubbing to spine head and foot, five endpapers of pencil notes (only one small table in ink), few notes to title page, three ink notes to front free endpaper, small tear to top-rear DJ, very mild rubbing to DJ edges, else Good(+) in Good(+) DJ. First edition (presumed; no earlier dates stated).

Seller Inventory # 88608

Bibliographic Details

• Title: Algebraic Coding Theory
• Publisher: McGraw-Hill, New York, New York
• Publication Date: 1968
• Language: English
• ISBN 10: 0070049033
• ISBN 13: 9780070049031
• Binding: Hardcover
• Edition: 1st Edition
• Condition: Good
• Dust Jacket Condition: Dust Jacket Included
• Seller catalogs:
  • Mathematics

About this title

Synopsis

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 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.

Product Description

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.