Published September 1977
| Published
Journal Article
Open
An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels
- Creators
- McEliece, Robert J.
- Omura, Jim K.
Chicago
An error occurred while generating the citation.
Abstract
The recent upper bounds on the minimum distance of binary codes given by McEliece, Rodemich, Rumsey, and Welch are shown to result in improved upper bounds on the block coding error exponent for binary-input memoryless channels.
Additional Information
© 1977 IEEE. Reprinted with permission. Manuscript received June 30, 1976; revised January 6, 1977. This work was supported in part by the National Aeronautics and Space Administration under Contract NAS 7-100 and in part by the National Science Foundation under Grant ENG 75 03224.Attached Files
Published - MCEieeetit77b.pdf
Files
MCEieeetit77b.pdf
Files
(502.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:53399af130b437b54c66090cfe79e1e1
|
502.9 kB | Preview Download |
Additional details
- Eprint ID
- 6933
- Resolver ID
- CaltechAUTHORS:MCEieeetit77b
- NASA
- NAS 7-100
- NSF
- ENG 75-3224
- Created
-
2007-01-03Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field