A note on the Griesmer bound (Corresp.)

Griesmer's lower bound for the word length
n
of a linear code of dimension
k
and minimum distance
d
is shown to be sharp for fixed
k
, when
d
is sufficiently large. For
k \leq 6
and all
d
the minimum word length is determined.