Citation
Abstract
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. k-1 n(k,d)= 3d.
Details
- Volume
- IX
- Published
- June 15, 1972
- Pages
- 49–52
- File Size
- 224.4 KB