On the undetected error probability of triple-error-correcting BCH codes
From MaRDI portal
Publication:3358653
DOI10.1109/18.79930zbMATH Open0731.94018OpenAlexW2009307658MaRDI QIDQ3358653FDOQ3358653
Authors: Chong T. Ong, Cyril Leung
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.79930
Recommendations
- Concerning a bound on undetected error probability (Corresp.)
- Undetected error probabilities of codes for single-error correction and error detection
- Linear block codes for error detection (Corresp.)
- Necessary conditions for good error detection
- Evaluation of the Undetected Error Probability of Single Parity-Check Product Codes
Cited In (6)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)
- A survey on proper codes
- Evaluation of the Undetected Error Probability of Single Parity-Check Product Codes
This page was built for publication: On the undetected error probability of triple-error-correcting BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358653)