The Mathematics of Coding Theory / Edition 1

The Mathematics of Coding Theory / Edition 1

by Paul Garrett
     
 

This book makes a very accessible introduction to a very important contemporary application of number theory, abstract algebra, and probability. It contains numerous computational examples throughout, giving learners the opportunity to apply, practice, and check their understanding of key concepts. KEY TOPICS Coverage starts from scratch in

See more details below

Overview

This book makes a very accessible introduction to a very important contemporary application of number theory, abstract algebra, and probability. It contains numerous computational examples throughout, giving learners the opportunity to apply, practice, and check their understanding of key concepts. KEY TOPICS Coverage starts from scratch in treating probability, entropy, compression, Shannon¿s theorems, cyclic redundancy checks, and error-correction. For enthusiasts of abstract algebra and number theory.

Product Details

ISBN-13:
9780131019676
Publisher:
Pearson
Publication date:
11/24/2003
Edition description:
New Edition
Pages:
408
Product dimensions:
7.04(w) x 9.40(h) x 0.85(d)

Table of Contents

1. Probability.

Counting. Preliminary Ideas of Probability. More Formal View of Probability. Random Variables, Expected Values, Variance. Markov Inequality, Chebycheff Inequality. Law of Large Numbers.

2. Information and Entropy.

Uncertainty, Acquisition of Information. Entropy. Uniquely-Decipherable and Prefix Codes. Kraft and Macmillan Inequalities.

3. Noiseless Coding.

Noiseless Coding Theorem. Huffman Coding.

4. Noisy Coding.

Noisy channels. Example: Parity Checks. Decoding from a Noisy Channel. Channel Capacity. Noisy Coding Theorem.

5. Cyclic Redundancy Checks.

The Finite Field GF(2) with 2 Elements. Polynomials over GF(2). Cyclic Redundancy Checks (CRC's). What Errors Does a CRC Catch?

6. The Integers.

Reduction Algorithm. Divisibility. Factorization into Primes. Euclidean Algorithm. Integers Modulo M. The Finite Field Z/P for P Prime. Fermat's Little Theorem. Primitive Roots. Euler's Criterion. Fast Modular Exponentiation.

7. Finite Fields.

Making Fields. Examples of Field Extensions. Addition Modulo P. Multiplication Modulo P. Multiplicative Inverses Modulo P. Primitive Roots.

8. Polynomials.

Polynomials with Coefficients in a Field. Divisibility. Factoring and Irreducibility. Euclidean Algorithm. Unique Factorization.

9. Introduction to Linear Codes.

An Ugly Example. The Hamming Binary [7,4] Code. Some Linear Algebra. A Review of Row Reduction. Definition: Linear Codes. Syndrome Decoding. Berlekamp's Algorithm.

10. Bounds for Codes.

Hamming (Sphere-Packing) Bound. Gilbert-Varshamov Bound. Singleton Bound.

11. Cyclic Codes.

Minimum Distance in Linear Codes. Cyclic Codes.

12. Primitive Roots.

Characteristics of Fields. Multiple Factors in Polynomials. Cyclotomic Polynomials. Primitive Roots in Finite Fields. Primitive Roots Modulo Prime Powers. Counting Primitive Roots. Non-Existence. An Algorithm to Find Primitive Roots.

13. Primitive Polynomials.

Definitions. Examples Modulo 2. Testing for Primitivity. Example: Periods of LFSR's. Example: Two-Bit Errors Detected by CRC's.

14. Basic Linear Codes.

Vandermonde Determinants. More Check Matrices for Cyclic Codes. RS Codes. Hamming Codes (Again). BCH Codes. Decoding BCH Codes.

15. Concatenated Codes.

Mirage Codes. Concatenated Codes. Justesen Codes. Some Explicit Irreducible Polynomials.

16. Curves and Codes.

Plane Curves. Singularities of Curves. Projective Plane Curves. Curves in Higher Dimensions. Genus, Divisors, Linear Systems. Geometric Goppa Codes. Tsfasman-Vladut-Zink Bound.

Appendices.

Sets and functions. Equivalence Relations. Stirling's Formula.

Bibliography.

Index.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >