Title :
Asymptotic bounds on the covering radius of binary codes
Author_Institution :
CNRS, Valbonne, France
fDate :
11/1/1990 12:00:00 AM
Abstract :
Asymptotic covering properties of families of binary codes are studied. A Gaussian approximation to the weight distribution of translates for codes of high strength is used. From this an upper bound on the covering radius of these codes is deduced. Applications include Reed-Muller codes, quadratic residue codes, and BCH codes. Sufficient conditions for a family of codes to have best possible covering radius (asymptotically perfect codes) are derived
Keywords :
error correction codes; BCH codes; Gaussian approximation; Reed-Muller codes; asymptotic bounds; binary codes; covering radius; quadratic residue codes; upper bound; weight distribution of translates; Binary codes; Entropy; Equations; Error correction codes; Gaussian approximation; Information science; Sufficient conditions; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
