Published January 1973
| Published
Journal Article
Open
A note on the Griesmer bound
- Creators
- Baumert, L. D.
- McEliece, R. J.
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.
Additional Information
© 1973 IEEE. Reprinted with permission. Manuscript received April 10, 1972. This research was supported by the National Aeronautics and Space Administration under Contract NAS 7-100.Attached Files
Published - BAUieeetit73.pdf
Files
BAUieeetit73.pdf
Files
(293.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:7dcf5339090a6982c5e0841495f31706
|
293.8 kB | Preview Download |
Additional details
- Eprint ID
- 6539
- Resolver ID
- CaltechAUTHORS:BAUieeetit73
- NAS 7-100
- NASA
- Created
-
2006-12-12Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field