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 fix.