A note on the Griesmer bound
L. D. Baumert, Robert J. McEliece · CaltechAUTHORS (California Institute of Technology) · 1973
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 ≤ 6 and all d the minimum word length is determined.