A new lower bound on the minimal length of a binary linear code
\textit{S. M. Dodunekov} and \textit{N. L. Manev} have given lower bounds for \(n(k,d)\), the smallest integer for which there exists a binary \([n, k, d]\)-code [see Discrete Appl. Math. 12, 103-114 (1985; Zbl 0603.94011)]. For many values, these bounds are improved. The question of existence of certain codes is examined to prepare a table of bounds on \(n(9, d)\) for \(d\leq 2^8\).
scientific article; zbMATH DE number 895871