A nonconstructive upper bound on covering radius
Gérard Cohen · IEEE Transactions on Information Theory · 1983
Lett(n,k)denote the minimum covering radius of a binary linear(n,k)code. We give a nonconstructive upper bound ont(n,k), which coincides asymptotically with the known lower bound, namelyn^{-1}t(n,nR)=H^{-1}(1-R)+O(n^{-l}\log n), whereRis fixed,0<R<1, andH^{-1}is the inverse of the binary entropy function.