A lower bound on the undetected error probability and strictly optimal codes
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (5) , 1489-1502
- https://doi.org/10.1109/18.623147
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Bounds on the worst case probability of undetected errorIEEE Transactions on Information Theory, 1995
- The weight distribution of cosetsIEEE Transactions on Information Theory, 1994
- Optimal codes for error detectionIEEE Transactions on Information Theory, 1992
- Using codes for error correction and detection (Corresp.)IEEE Transactions on Information Theory, 1984
- Generalizations of the Korzhik bound (Corresp.)IEEE Transactions on Information Theory, 1984
- On the Probability of Undetected Error for the Maximum Distance Separable CodesIEEE Transactions on Communications, 1984
- Linear block codes for error detection (Corresp.)IEEE Transactions on Information Theory, 1983
- On the Probability of Undetected Error for Linear Block CodesIEEE Transactions on Communications, 1982
- A fundamental inequality between the probabilities of binary subgroups and cosetsIEEE Transactions on Information Theory, 1967
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964