On error-and-erasure decoding of cyclic codes
From MaRDI portal
Recommendations
- Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
- A decoding procedure for multiple-error-correcting cyclic codes
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
Cited in
(9)- Trellis codes for periodic erasures
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- Capability of the error-trapping technique in decoding cyclic codes
- Fault-Tolerant Decoders for Cyclic Error-Correcting Codes
- Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
- Cyclically permutable error-correcting codes
This page was built for publication: On error-and-erasure decoding of cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990787)