Algebraic Coding Theory (Systems Science)

Berlekamp, Elwyn R.

ISBN 10: 0070049033 / ISBN 13: 9780070049031

Published by McGraw-Hill Book Company, 1968

About this Item

A very good copy in only slightly worn dustjacket.
**PLEASE NOTE** that there may be a surcharge to pay for international postage (at cost) on this item: we'll advise you of the amount when you order, and you will have the option of accepting or cancelling at that point.

Seller Inventory # 25111309

Bibliographic Details

• Title: Algebraic Coding Theory (Systems Science)
• Publisher: McGraw-Hill Book Company
• Publication Date: 1968
• Language: English
• ISBN 10: 0070049033
• ISBN 13: 9780070049031
• Binding: Hardcover
• Condition: Very Good
• Dust Jacket Condition: Very Good
• Weight: 230 grams

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.