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

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