Abstract
The problem of determining K 3( n,1), the minimum size of a ternary code of length n and covering radius 1, is called the football pool problem. By construction, it is here shown that K 3(9,1)⩽1269. A code whose full automorphism group has order 648 is given, but this bound is actually achieved by a vast number of inequivalent codes.
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.
