Some new results on the minimum length of binary linear codes of dimension nine
S.M. Dodunekov, Sugi Guritman, Juriaan Simonis · IEEE Transactions on Information Theory · 1999
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and minimum distance d exists. Using the residual code technique, the MacWilliams identities and the weight distribution of appropriate Reed-Muller codes, we prove that n(9, 64)=133, n(9, 120)/spl ges/244, n(9, 124)=252, and n(9, 184)=371. We also show that puncturing a known [322, 9, 160]-code yields length-optimal codes with parameters [319, 9, 158], [315, 9, 156], and [312, 9, 154].