Subcodes and covering radius
暂无分享,去创建一个
A sharp lower bound on the covering radius of a linear, binary code is given in terms of the covering radius of any subcode of index two. An upper bound on the norm of a code is then derived. These results hold for all linear codes over GF (2) .
[1] N. J. A. Sloane,et al. On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.