A nonconstructive upper bound on covering radius
暂无分享,去创建一个
Let t(n,k) denote the minimum covering radius of a binary linear (n,k) code. We give a nonconstructive upper bound on t(n,k) , which coincides asymptotically with the known lower bound, namely n^{-1}t(n,nR)=H^{-1}(1-R)+O(n^{-l}\log n) , where R is fixed, 0 , and H^{-1} is the inverse of the binary entropy function.
[1] Philippe Delsarte,et al. Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..
[2] Harold F. Mattson,et al. Some 3-error-correcting BCH codes have covering radius 5 (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[3] Tor Helleseth,et al. On the covering radius of binary codes (Corresp.) , 1978, IEEE Trans. Inf. Theory.