DocumentCode
1516975
Title
A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
Author
Shum, Kenneth W. ; Wong, Wing Shing ; Chen, Chung Shue
Author_Institution
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
Volume
56
Issue
7
fYear
2010
fDate
7/1/2010 12:00:00 AM
Firstpage
3265
Lastpage
3276
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 constant-weight 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
Hamming codes; Hamming weights; code lengths; constant-weight conflict-avoiding codes; multiple-access collision channel; Binary sequences; Councils; Delay; Electronic mail; Hamming weight; Optical feedback; Optical sensors; Protocols; Stacking; Upper bound; Conflict-avoiding code; optical orthogonal code; protocol sequence;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2048508
Filename
5484994
Link To Document