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}}$$ .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
