By Topic

On upper bounds for error detecting and error correcting codes of finite length

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Upper bounds for error detecting and error correcting codes are obtained in this paper. One upper bound is found by exploiting the geometrical model of coding introduced by Hamming. The volume of an appropriate geometrical body is compared with the volume of the unit cube, in getting the first upper bound. An improvement on this upper bound can be found by introducing a mass density function, and comparing the mass of the body with the mass of the unit cube. A comparison is made with known upper bounds, and with best codes found thus far. The improved upper bound given here is frequently somewhat smaller than previously known upper bounds.

Published in:

Information Theory, IRE Transactions on  (Volume:5 ,  Issue: 4 )