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

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 code...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2010-07, Vol.56 (7), p.3265-3276
Main Authors: Shum, Kenneth W, Wing Shing Wong, Chung Shue Chen
Format: Article
Language:English
Subjects:
Binary sequences
Channels
Codes
Conflict-avoiding code
Construction
Councils
Delay
Electronic mail
Feedback
Hamming weight
Information science
Information theory
Multiplexers
Optical feedback
optical orthogonal code
Optical sensors
Optimization
protocol sequence
Protocols
Stacking
Upper bound
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2048508