Compositional Restricted Multiple Access Channel
- 作者: Egorova E.E.1, Potapova V.S.1
-
隶属关系:
- Skolkovo Institute of Science and Technology
- 期: 卷 54, 编号 2 (2018)
- 页面: 116-123
- 栏目: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166497
- DOI: https://doi.org/10.1134/S0032946018020023
- ID: 166497
如何引用文章
详细
We introduce the notion of a q-ary s-compositional code and prove that the rate, R, of the best such code satisfies for large s the asymptotic inequalities
\((q - 1)\frac{{{{\log }_q}s}}{{4s}} \lesssim 2(q - 1)\frac{{{{\log }_q}s}}{{4s}}\)![]()
.作者简介
E. Egorova
Skolkovo Institute of Science and Technology
编辑信件的主要联系方式.
Email: egorovahelene@gmail.com
俄罗斯联邦, Moscow
V. Potapova
Skolkovo Institute of Science and Technology
Email: egorovahelene@gmail.com
俄罗斯联邦, Moscow
补充文件
