## Introduction to the Theory of Error-Correcting CodesA complete introduction to the many mathematical tools used to solve practical problems in coding. Mathematicians have been fascinated with the theory of error-correcting codes since the publication of Shannon's classic papers fifty years ago. With the proliferation of communications systems, computers, and digital audio devices that employ error-correcting codes, the theory has taken on practical importance in the solution of coding problems. This solution process requires the use of a wide variety of mathematical tools and an understanding of how to find mathematical techniques to solve applied problems. Introduction to the Theory of Error-Correcting Codes, Third Edition demonstrates this process and prepares students to cope with coding problems. Like its predecessor, which was awarded a three-star rating by the Mathematical Association of America, this updated and expanded edition gives readers a firm grasp of the timeless fundamentals of coding as well as the latest theoretical advances. This new edition features: * A greater emphasis on nonlinear binary codes * An exciting new discussion on the relationship between codes and combinatorial games * Updated and expanded sections on the Vashamov-Gilbert bound, van Lint-Wilson bound, BCH codes, and Reed-Muller codes * Expanded and updated problem sets. Introduction to the Theory of Error-Correcting Codes, Third Edition is the ideal textbook for senior-undergraduate and first-year graduate courses on error-correcting codes in mathematics, computer science, and electrical engineering. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Useful Background | 17 |

J H Conway and N J A Sloane Sphere Packings Lattices and Groups | 33 |

A DoubleErrorCorrecting BCH Code and a Finite Field | 39 |

R A Brualdi and V Pless Greedy codes JCT A64 1993 1030 | 46 |

Problems | 48 |

Cyclic Codes | 67 |

Group of a Code and Quadratic Residue QR Codes | 85 |

BoseChaudhuriHocquenghem BCH Codes | 109 |

Weight Distributions | 123 |

Designs and Games | 143 |

Some Codes Are Unique | 169 |

Appendix | 189 |

199 | |

202 | |

### Other editions - View all

### Common terms and phrases

4-tuples algorithm basis BCH code binary code binary cyclic codes binary vectors called code of length codewords coefficients compute consider construct contain coordinate positions Corollary coset leader cyclic shift cyclotomic cosets decoding scheme defined denote dimension divides double-error-correcting doubly-even equations equivalent errors example f-design factor field F finite field g-value GF(p give Gleason polynomials Golay code Hamming code Hence idempotent integers irreducible polynomial Kmod Lemma linear code matrix H minimal polynomial minimum weight modulo monic multiplication nonzero elements number of vectors octad orthogonal parity check matrix permutation polynomial g(x polynomial of degree power moments Problem Proof QR code quadratic residue received vector reciprocal polynomial Reed-Muller codes roots rows of G self-dual code self-orthogonal set of vectors smallest solution Steiner system subspace Suppose syndrome Table ternary Theorem unique vector space vectors of weight weight distribution weight enumerator winning positions Z4 codes zero

### References to this book

Handbook of Computational Group Theory Derek F. Holt,Bettina Eick,Eamonn A. O'Brien No preview available - 2005 |