CaltechAUTHORS
  A Caltech Library Service

A low-rate improvement on the Elias bound

Welch, Lloyd R. and McEliece, Robert J. and Rumsey, Howard, Jr. (1974) A low-rate improvement on the Elias bound. IEEE Transactions on Information Theory, 20 (5). pp. 676-678. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74

[img]
Preview
PDF - Published Version
See Usage Policy.

343Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74

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).


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TIT.1974.1055279DOIArticle
Additional Information:© 1974 IEEE. Reprinted with permission. Manuscript received January 21, 1974. This work was supported by NASA under Contract NAS 7-100.
Funders:
Funding AgencyGrant Number
NASANAS 7-100
Issue or Number:5
Record Number:CaltechAUTHORS:WELieeetit74
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74
Alternative URL:http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=22680&arnumber=1055279&count=33&index=17
Official Citation:L. Welch, R. McEliece and H. Rumsey, "A low-rate improvement on the Elias bound (Corresp.)," in IEEE Transactions on Information Theory, vol. 20, no. 5, pp. 676-678, September 1974. doi: 10.1109/TIT.1974.1055279
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6238
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:29 Nov 2006
Last Modified:02 Oct 2019 23:30

Repository Staff Only: item control page