Griesmer\´s lower bound for the word length of a linear code of dimension and minimum distance is shown to be sharp for fixed , when is sufficiently large. For and all the minimum word length is determined.
Keywords :
Error-correcting codes; Linear codes; Galois fields; Linear code; Sufficient conditions;