Answers are grounded in this paper and cite their sources.
Let <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t(n,k)</tex> denote the minimum covering radius of a binary linear <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n,k)</tex> code. We give a nonconstructive upper bound on <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t(n,k)</tex> , which coincides asymptotically with the known lower bound, namely <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n⁻¹t(n,nR)=H⁻¹(1-R)+O(n⁻ˡlog n)</tex> , where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</tex> is fixed, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0<R<1</tex> , and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H⁻¹</tex> is the inverse of the binary entropy function.
No takes yet. Share an insight, caveat, or question.
Gérard Cohen (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: