Compositional Restricted Multiple Access Channel


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2018