Abstract
We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of q-ary 2‾-separable codes that improves recent results of Wang for any q≥13. For the case q=2, we recover a result of Lindström, but with a much simpler derivation. The method easily extends to give bounds on B2 codes which, although not improving on Wang's results, use much simpler tools and might be useful for future applications.
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.
