Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Baumert et al. (1973) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: