Home › Computers › Algebraic Coding Theory (REV Ed)

Algebraic Coding Theory (REV Ed)

by Berlekamp Elwyn R Publisher: WORLD SCIENTIFIC PUB CO INC

Algorithms and codes over finite fields

Regular price $188.27 USD
Regular price $209.19 USD Sale price $188.27 USD
Save 10%

Hardcover New English

In stock · Dispatches in 1–2 business days
Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

Algorithms and codes over finite fields

This revised edition brings together work in algebraic coding theory spanning decoding algorithms, polynomial factorization over finite fields, and arithmetic in fields of characteristic two. It also covers Lee metric codes and asymptotic results concerning the information-symbol count of long binary BCH codes. The topics connect abstract algebraic methods with coding and computation, making the book useful as a reference across both theoretical and engineering contexts. Its 474 pages offer substantial coverage of a specialized area of information theory.

Good fit for readers who enjoy

  • Practicing engineers working with coding methods
  • Scholars in algebraic coding theory and information theory
  • Graduate students studying coding theory

Themes

Algebraic coding theoryError-correcting codesFinite fieldsAlgorithms and computation

Based on publisher information and book metadata.

Book overview

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.

Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews

M
AlbakiReads
Malaika Taylor

I highly recommend to for anyone looking for inner clarity

T
AlbakiReads
Thomas DiMassa

Great service and fast service

Great shopping experience! The book arrived quickly, was well packaged, and matched the description perfectly. I would definitely shop with you again

O
AlbakiReads
Olivia

Smooth.