IEEE Transactions on Information Theory · 1991 · 30 citations · 27 references
Natural SciencesComputer ScienceMathematicsCombinatoricsSet TheoryTheory Of ComputationCoding TheoryComputational ComplexityError-correcting CodesBounds On CodesCode BoundsCovering CodesHamming CodesHamming DistanceLower BoundsMinimum Distance
The lower bounds on K(n,R), minimum number of codewords of any binary code of length n, and covering radius R are improved. A new technique combining the Hamming association scheme and the results of a classic problem of covering pairs by k-tuples is introduced. The new lower bounds are obtained by studying various linear inequalities satisfied by covering codes, and such an inequality is derived. The lower bounds for K(n,R) are studied for some special values of n and R, which serve as examples showing how the methods developed are applied to concrete cases.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
27
Haim Hanani · Canadian Journal of Mathematics · 1960 · 336 citations · Full text
Covering radius---Survey and recent results
Gérard Cohen, Mark G. Karpovsky, H. F. Mattson et al. · IEEE Transactions on Information Theory · 1985 · 262 citations
On the covering radius of codes
Ron Graham, N. J. A. Sloane · IEEE Transactions on Information Theory · 1985 · 180 citations
Johanan Schonheim · Pacific Journal of Mathematics · 1964 · 172 citations · Full text