Binary linear quasi-perfect codes are normal

Whether quasi-perfect codes are normal is addressed. Let C be a code of length n, dimension k, covering radius R, and minimal distance d. It is proved that C is normal if d>or=2R-1. Hence all quasi-perfect codes are normal. Consequently, any (n,k)R binary linear code with minimal distance d>or=2R-1 is normal. >

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

[2]  Shu Lin,et al.  On the Probability of Undetected Error for the Maximum Distance Separable Codes , 1984, IEEE Trans. Commun..

[3]  Tor Helleseth,et al.  On the cosets of the simplex code , 1985, Discret. Math..

[4]  Richard A. Brualdi,et al.  Orphans of the first order Reed-Muller codes , 1990, IEEE Trans. Inf. Theory.

[5]  Xiang-dong Hou,et al.  Some results on the norm of codes , 1990, IEEE Trans. Inf. Theory.

[6]  Gerhard J. M. van Wee.  Binary coveting codes are normal , 1990, IEEE Trans. Inf. Theory.

[7]  Ning Cai,et al.  Orphan structure of the first-order Reed-Muller codes , 1992, Discret. Math..

[8]  Jack K. Wolf,et al.  On the Probability of Undetected Error for Linear Block Codes , 1982, IEEE Trans. Commun..

[9]  Jack K. Wolf,et al.  Poor error correction codes are poor error detection codes , 1984, IEEE Trans. Inf. Theory.

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