Compositional Restricted Multiple Access Channel

Abstract

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}}\)

.