论文信息 - On normal and subnormal q-ary codes

On normal and subnormal q-ary codes

The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3. >

Antoine Lobstein | Gerhard J. M. van Wee | A. Lobstein | G. Wee

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

[2] R. G. Stanton,et al. Intersection Inequalities for the Covering Problem , 1969 .

[3] Heikki Hämäläinen,et al. Upper bounds for football pool problems and mixed covering codes , 1991, J. Comb. Theory, Ser. A.

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

[5] N. J. A. Sloane,et al. On a conjecture concerning coverings of Hamming space , 1984, AAECC.

[6] Emile H. L. Aarts,et al. New upper bounds for the football pool problem for 6, 7, and 8 matches , 1989, J. Comb. Theory, Ser. A.

[7] Clement W. H. Lam,et al. More Coverings by Rook Domains , 1984, J. Comb. Theory, Ser. A.

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

[9] Iiro Honkala,et al. A new construction for covering codes , 1988, IEEE Trans. Inf. Theory.

[10] J. H. van Lint,et al. A covering problem , 1970 .

[11] Wende Chen,et al. New lower bounds for binary covering codes , 1988 .

[12] R. G. Stanton,et al. A Combinatorial Problem in Matching , 1969 .

[13] R. G. Stanton,et al. Covering Problems for Dichotomized Matching , 1968 .

[14] J. H. van Lint,et al. The football pool problem for 5 matches , 1967 .

[15] Gerhard J. M. van Wee,et al. Improved sphere bounds on the coveting radius of codes , 1988, IEEE Trans. Inf. Theory.