Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimal conflict-avoiding codes for 3, 4 and 5 active users

Optimal conflict-avoiding codes for 3, 4 and 5 active users 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Optimal conflict-avoiding codes for 3, 4 and 5 active users

Loading next page...
 
/lp/springer_journal/optimal-conflict-avoiding-codes-for-3-4-and-5-active-users-Nulp7x5zP3

References (25)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946017010033
Publisher site
See Article on Publisher Site

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Apr 23, 2017

There are no references for this article.