Title :
Improved sphere bounds on the covering radius of codes
Author :
Van Wee, Gerhard J M
Author_Institution :
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
fDate :
3/1/1988 12:00:00 AM
Abstract :
The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)⩾2 n/n for n even. A table of lower and upper bounds on K(n,R) for n⩽33, R ⩽10 is included
Keywords :
error correction codes; binary code; covering radius; minimal cardinality; sphere bound; trivial lower bound; upper bounds; Binary codes; Linear code; Mathematics; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
