Some bounds for the minimum length of binary linear codes of dimension nine
Iliya Bouyukliev, Sugi Guritman, V. Vavrek · IEEE Transactions on Information Theory · 2000
We prove the nonexistence of binary [69,9,32] codes and construct codes with parameters [76,9,34],[297,9,146], and [300,9,148]. These results show that n(9,32)=70, n(9,34)/spl les/76,n(9,146)=297, and n(9,148)=300, where n(k,d) denotes the smallest value of n for which there exists an [n,k,d] binary code. We also present some codes of minimum distance 32 and some related codes.