A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
Information Theory
2010-11-09 v3 math.IT
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.
Keywords
Cite
@article{arxiv.0910.5073,
title = {A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes},
author = {Kenneth W. Shum and Wing Shing Wong and Chung Shue Chen},
journal= {arXiv preprint arXiv:0910.5073},
year = {2010}
}
Comments
10 pages, 1 figure