Abstract
In this paper, we complete the classification of binary optimal linear [ n, n/2] codes up to length 28. We have determined that there are 1535 inequivalent [14,7,4] codes, 1682 inequivalent [20,10,6] codes, and 3 inequivalent [26,13,7] codes. In addition, we show that the smallest length for which an optimal rate 1 2 code has a trivial automorphism group is 14. Double circulant codes which attain the highest known minimum distance are given for lengths up to 64.
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.
