A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 302-306
Abstract
In this paper, we study the probability of undetected error for binary constant weight codes (BCWCs). First, we derive a new lower bound on the probability of undetected error. Next, we show that this bound is tight if and only if the BCWCs are generated from certain t-designs. This means that such BCWCs are uniformly optimal for error detection. Thus, we prove a conjecture of Xia, Fu, Jiang and Ling. Furthermore, we determine the distance distributions of such BCWCs. Finally, we derive some bounds on the exponent of the probability of undetected error for BCWCs. These bounds enable us to extend the region in which the exponent of the probability of undetected error is exactly determinedKeywords
This publication has 11 references indexed in Scilit:
- The Probability of Undetected Error for Binary Constant-Weight CodesIEEE Transactions on Information Theory, 2005
- On the undetected error probability for binary codesIEEE Transactions on Information Theory, 2003
- On the Undetected Error Probability of m-out-of-n Codes on the Binary Symmetric Channel2000
- Binomial moments of the distance distribution: bounds and applicationsIEEE Transactions on Information Theory, 1999
- New upper bounds on error exponentsIEEE Transactions on Information Theory, 1999
- Binomial Moments of the Distance Distribution and the Probability of Undetected ErrorDesigns, Codes and Cryptography, 1999
- Association schemes and coding theoryIEEE Transactions on Information Theory, 1998
- A lower bound on the undetected error probability and strictly optimal codesIEEE Transactions on Information Theory, 1997
- Error Detecting Codes1995
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977