Abstract
Conflict-avoiding codes are used in multiple-access collision channels without feedback. The number of codewords in a conflict-avoiding code is the number of potential users of the channel. That is why codes with maximum cardinality (optimal codes) for given parameters are of interest. In this paper we classify, up to multiplier equivalence, all optimal conflict-avoiding codes of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the maximum cardinality of conflict-avoiding codes of weights 4 and 5.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
