The code is unique
arXiv:1906.02621 · doi:10.3934/amc.2020074
Abstract
The minimum distance of all binary linear codes with dimension at most eight is known. The smallest open case for dimension nine is length with known bounds . Here we present a code and show its uniqueness. Interestingly enough, this unique optimal code is asymmetric, i.e., it has a trivial automorphism group. Additionally, we show the non-existence of and codes.
7 pages, 3 tables, typos corrected