Abstract
In a recent paper by the same author general improvements on the sphere covering bound for binary covering codes were obtained. In the present work it is shown how the main idea can be exploited to obtain “improved sphere bounds” also for nonbinary codes. We concentrate on general q-ary codes and on binary/ternary mixed codes. Special attention is paid to the football pool problem; a few new lower bounds are established. Also, it is shown how a similar method yields upper bounds on packing codes.
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.
