Algebraic coding theory /
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 err...
Guardado en:
Autor principal: | |
---|---|
Formato: | Libro |
Lenguaje: | Inglés |
Publicado: |
New York :
McGraw-Hill,
1968.
|
Colección: | Systems Science
|
Materias: | |
Aporte de: | Registro referencial: Solicitar el recurso aquí |
LEADER | 01390Cam#a22002535a#4500 | ||
---|---|---|---|
001 | INGC-MON-019477 | ||
003 | AR-LpUFI | ||
005 | 20221019005819.0 | ||
008 | 180524s1968||||nyu|||||||||||||||||eng d | ||
020 | |a 070049033 | ||
040 | |a AR-LpUFI |b spa |c AR-LpUFI | ||
080 | |a 512 | ||
100 | 1 | |a Berlekamp, Elwyn R. |9 305988 | |
245 | 1 | 0 | |a Algebraic coding theory / |c Elwyn R. Berlekamp. |
260 | |a New York : |b McGraw-Hill, |c 1968. | ||
300 | |a 466 p. | ||
490 | |a Systems Science | ||
520 | 2 | |a 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. | |
650 | 4 | |a ALGEBRA |9 262846 | |
650 | 4 | |a CODIFICACION |9 279679 | |
650 | 4 | |a ALGORITMOS |9 263366 | |
929 | |a 42263 DON Montenegro | ||
942 | |c LIB |6 _ | ||
999 | |a GEB |c 19476 |d 19476 |