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

1 September 1974

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 20 (5) , 676-678
https://doi.org/10.1109/tit.1974.1055279

Abstract

An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound forR < 0.0509^+, is obtained. The new hound has the same derivative(-\infty)atR = 0as Gilbert's lower bound. (Elias' bound has derivative-\ln 2atR = 0).

Keywords

MINIMUM DISTANCE
LOW-RATE IMPROVEMENT
BOUND FORR
NEW HOUND
BINARY BLOCKS CODE
EXPONENTIAL DISTRIBUTION
UPPER BOUND
PROPULSION
ENTROPY
LOWER BOUND
BLOCK CODES
SPACE TECHNOLOGY
PREDICTIVE MODELS

This publication has 0 references indexed in Scilit: