Optimal conflict-avoiding codes for 3, 4 and 5 active users
- 作者: Baicheva T.1, Topalova S.1
-
隶属关系:
- Institute of Mathematics and Informatics
- 期: 卷 53, 编号 1 (2017)
- 页面: 42-50
- 栏目: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166352
- DOI: https://doi.org/10.1134/S0032946017010033
- ID: 166352
如何引用文章
详细
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.
作者简介
T. Baicheva
Institute of Mathematics and Informatics
编辑信件的主要联系方式.
Email: tsonka@math.bas.bg
保加利亚, Sofia
S. Topalova
Institute of Mathematics and Informatics
Email: tsonka@math.bas.bg
保加利亚, Sofia
补充文件
