A low-rate improvement on the Elias bound (Corresp.)

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 hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1974-09, Vol.20 (5), p.676-678
Main Authors: Welch, L., McEliece, R., Rumsey, H.
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1974.1055279