and also for
.
The general problem:
Determine all triples [n,k,d] for which there exists a binary linear code of length n, dimension k, and minimum distance d.
Exact answers are known for:
and also for
.
", to appear in
Discrete Mathematics, and
"The smallest length of eight-dimensional binary
linear codes with prescribed minimum distance", preprint, summer 1999,
coauthored with Iliya Bouyukliev and Vesselin Vavrek.)