Please use this identifier to cite or link to this item:
|Title:||A lower bound on the probability of undetected error for binary constant weight codes||Authors:||Xia, S.-T.
|Issue Date:||2006||Citation:||Xia, S.-T., Fu, F.-W., Ling, S. (2006). A lower bound on the probability of undetected error for binary constant weight codes. IEEE International Symposium on Information Theory - Proceedings : 302-306. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2006.261602||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 determined. © 2006 IEEE.||Source Title:||IEEE International Symposium on Information Theory - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/111522||ISBN:||1424405041||ISSN:||21578101||DOI:||10.1109/ISIT.2006.261602|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.