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

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

2009-10-27

arxiv.org/abs/0910.5073v3

IEEE Trans. Inform. Theory, vol. 56, no.7, p.3265-3276, Jul, 2010

Computer Science

Information Theory

10 pages, 1 figure

Scientific paper

10.1109/TIT.2010.2048508

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.

Affiliated with

Also associated with

No associations

Rating

A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-482573