论文信息 - Some results on the norm of codes

Some results on the norm of codes

Two upper bounds for the norm N(C) of a binary linear code C with minimal weight d and covering radius R are given. The second of these bounds implies that C is normal if R=3. >

Xiang-dong Hou | Xiang-dong Hou

[1] Michael J. Adams,et al. Subcodes and covering radius , 1986, IEEE Trans. Inf. Theory.

[2] N. J. A. Sloane,et al. On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[3] N. J. A. Sloane,et al. Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.

[4] K. E. Kilby,et al. On the covering radius problem for codes II. codes of low dimension; normal and abnormal codes , 1987 .

[5] N. Sloane,et al. On the covering radius problem for codes I. bounds on normalized covering radius , 1987 .