On (q, 1)-subnormal q-ary Covering Codes
暂无分享,去创建一个
[1] Iiro S. Honkala,et al. Some lower bounds for constant weight codes , 1987, Discret. Appl. Math..
[2] Andrew R. Barron,et al. Correction to 'Minimum Complexity Density Estimation' , 1991, 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] J. H. van Lint,et al. Covering radius problems , 1988 .
[5] Wende Chen,et al. New lower bounds for binary covering codes , 1988 .
[6] R. G. Stanton,et al. A Combinatorial Problem in Matching , 1969 .
[7] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .
[8] Iiro S. Honkala,et al. On (k, t) -subnormal covering codes , 1991, IEEE Trans. Inf. Theory.
[9] Patric R. J. Östergård,et al. Upper bounds for q-ary covering codes , 1991, IEEE Trans. Inf. Theory.
[10] Patric R. J. Östergård,et al. Further results on (k, t)-subnormal covering codes , 1992, IEEE Trans. Inf. Theory.
[11] N. J. A. Sloane,et al. Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.
[12] Clement W. H. Lam,et al. More Coverings by Rook Domains , 1984, J. Comb. Theory, Ser. A.
[13] N. J. A. Sloane,et al. On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.
[14] Iiro Honkala,et al. A new construction for covering codes , 1988, IEEE Trans. Inf. Theory.
[15] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[16] Iiro S. Honkala,et al. Modified bounds for coveting codes , 1991, IEEE Trans. Inf. Theory.
[17] Antoine Lobstein,et al. On normal and subnormal q-ary codes , 1989, IEEE Trans. Inf. Theory.