Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)

DOI10.1109/TIT.1974.1055178zbMath0305.94017MaRDI QIDQ4063324

Carlos R. P. Hartmann, Kenneth K. Tzeng

Publication date: 1974

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

decoding methodBerlekamp's iterative algorithmdecoding of cyclic codes beyond the BCH boundmultiple sets of syndrome sequences

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (5)

Algebraic theory of block codes detecting independent errors ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ On some bounds on the minimum distance of cyclic codes over finite fields ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ A commutative algebra approach to linear codes

This page was built for publication: Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)