An improved sphere covering bound for the codes with n = 3R + 2
暂无分享,去创建一个
[1] N. J. A. Sloane,et al. Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.
[2] Gérard D. Cohen,et al. Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.
[3] Richard A. Brualdi,et al. On the Length of Codes with a Given Covering Radius , 1990 .
[4] Gerhard J. M. van Wee,et al. Improved sphere bounds on the coveting radius of codes , 1988, IEEE Trans. Inf. Theory.
[5] Xiang-dong Hou,et al. New lower bounds for covering codes , 1990, IEEE Trans. Inf. Theory.
[6] Iiro S. Honkala,et al. Modified bounds for coveting codes , 1991, IEEE Trans. Inf. Theory.
[7] Richard M. Wilson,et al. Short codes with a given coveting radius , 1989, IEEE Trans. Inf. Theory.
[8] N. J. A. Sloane,et al. On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.