Berlekamp, Elwyn R.

Algebraic coding theory / Elwyn R. Berlekamp. - New York : McGraw-Hill, 1968. - 466 p. - Systems Science .

Basic binary codes - Arithmetic operations modulo and irreducible vinary polynomial - The number ofirreducible q-ary polynomials of given degree - The structure of finite fields - Cyclic binary codes - The factorization of polynomials over finite fields - Binary bch codes for correcting multiple errors - Nonbinary coding - Negacyclic codes for the lee metric - Gorenstein-zierler generalized nonbinary bch codes for the hamming metric - Linearized polynomials and affine polynomials - The enumeration of information symbols in bch codes - The information rate of the optimum codes - Codes derived by modifyng or combining other codes - Other important coding and decoding methods - Weight enumerators - Appendices.

070049033


ALGEBRA
CODIFICACION
ALGORITMOS

512