Published September 1974
| Published
Journal Article
Open
A low-rate improvement on the Elias bound
Abstract
An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R < 0.0509^+, is obtained. The new bound has the same derivative(-infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative-ln 2 at R = 0).
Additional Information
© 1974 IEEE. Reprinted with permission. Manuscript received January 21, 1974. This work was supported by NASA under Contract NAS 7-100.Attached Files
Published - WELieeetit74.pdf
Files
WELieeetit74.pdf
Files
(352.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2edd053c50a7786b38986a83bcacc3c7
|
352.0 kB | Preview Download |
Additional details
- Eprint ID
- 6238
- Resolver ID
- CaltechAUTHORS:WELieeetit74
- NAS 7-100
- NASA
- Created
-
2006-11-29Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field