Please use this identifier to cite or link to this item:
|Title:||The probability of undetected error for binary constant-weight codes|
|Keywords:||Binary constant-weight codes|
Probability of undetected error
|Source:||Xia, S.-T., Fu, F.-W., Jiang, Y., Ling, S. (2005-09). The probability of undetected error for binary constant-weight codes. IEEE Transactions on Information Theory 51 (9) : 3364-3373. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2005.853313|
|Abstract:||In this correspondence, we study the probability of undetected error for binary constant-weight codes. First, we derive a new formula on the probability of undetected error for binary constant-weight codes. Second, using this new formula and linear programming, we give two new lower bounds on the probability of undetected error for binary constant-weight codes. These two new lower bounds improve on previously known lower bounds in certain cases. Furthermore, we show that these two lower bounds are tight if and only if the binary constant-weight codes are generated from certain t-designs in combinatorial design theory. This means that these binary constant-weight codes generated from certain t-designs are uniformly optimal for error detection. Along the way, we determine the distance distributions of such binary constant-weight codes. Finally, several examples are given to illustrate the results obtained in this correspondence. © 2005 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 8, 2018
WEB OF SCIENCETM
checked on Feb 7, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.