Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound

DOI10.1109/18.57215zbMATH Open0738.94019OpenAlexW2162983180MaRDI QIDQ3986484

Patrick Stevens

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1109/18.57215

zbMATH Keywords

Hartmann-Tzeng boundBCH-bounderror-erasure decoding for a cyclic code

Mathematics Subject Classification ID

Bounds on codes (94B65) Cyclic codes (94B15)

Related Items (4)

Capability of the error-trapping technique in decoding cyclic codes ⋮ Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance ⋮ General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula> ⋮ On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

This page was built for publication: Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986484)