Decoding beyond the BCH bound (Corresp.)
From MaRDI portal
Publication:5650277
DOI10.1109/TIT.1972.1054824zbMath0239.94010MaRDI QIDQ5650277
Publication date: 1972
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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 ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
This page was built for publication: Decoding beyond the BCH bound (Corresp.)
