A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes

Authors :: Shum, Kenneth W.
Wong, Wing Shing
Chen, Chung Shue
Source :: IEEE Trans. Inform. Theory, vol. 56, no.7, p.3265-3276, Jul, 2010
Publication Year :: 2009
Abstract: Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.<br />Comment: 10 pages, 1 figure

Database :: arXiv
Journal :: IEEE Trans. Inform. Theory, vol. 56, no.7, p.3265-3276, Jul, 2010
Publication Type :: Report
Accession number :: edsarx.0910.5073
Document Type :: Working Paper
Full Text :: https://doi.org/10.1109/TIT.2010.2048508