论文信息 - Normal and abnormal codes - 字舞流文

Normal and abnormal codes

It is proved that codes of length n, covering radius R, and minimum Hamming distance 2R-1 are normal if R does not divide n. Constructions for abnormal codes with covering radius R and minimum Hamming distance at least R-1 are given. >

Iiro S. Honkala | Tuvi Etzion | Gadi Greenberg

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

[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[3] Iiro S. Honkala,et al. Bounds for abnormal binary codes with covering radius one , 1991, IEEE Trans. Inf. Theory.

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

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

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

[7] Gérard D. Cohen,et al. Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[8] Xiang-dong Hou,et al. Binary linear quasi-perfect codes are normal , 1991, IEEE Trans. Inf. Theory.