Good error-detection codes satisfying the expurgated bound

DOI10.1109/18.412681MaRDI QIDQ4859759zbMATH OpenOpenAlexFDO

Authors Takeshi Hashimoto

Publication date 21 May 1996

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

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

zbMATH Keywords

error detectionerror exponenterror probabilityexpurgated boundexpurgated exponentgood error-correction codesproper codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Error probability in coding theory (94B70)

Recommendations

• A survey on proper codes
• scientific article; zbMATH DE number 2074251
• Using codes for error correction and detection (Corresp.)
• On the undetected error probability of binary expansions of Reed-Solomon codes
• Undetected error probabilities of codes for single-error correction and error detection

Cited in

(2)

• On the undetected error probability of binary expansions of Reed-Solomon codes
• Reed-Muller codes for error detection: the good, the bad, and the ugly

This page was built for publication: Good error-detection codes satisfying the expurgated bound

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