A New Table of Binary/Ternary Mixed Covering Codes

被引：8
作者：
Östergård P.R.J. [1 ]
Hämäläinen H.O. [1 ,2 ,3 ]
机构：
[1] Department of Computer Science, Helsinki University of Technology
[2] 41120 Puuppola
[3] c/o Patric R. J. Ostergard, Department of Computer Science, Helsinki University of Technology
来源：
Designs, Codes and Cryptography | 1997年 / 11卷 / 2期
关键词：
Covering codes; Football pool problem; Mixed codes; Simulated annealing;
D O I：
10.1023/A:1008228721072
中图分类号：
学科分类号：
摘要：
A table of upper bounds for K3,2(n1, n2; R), the minimum number of codewords in a covering code with n1 ternary coordinates, n2 binary coordinates, and covering radius R, in the range n = n1 + n2 ≤ 13, R ≤ 3, is presented. Explicit constructions of codes are given to prove the new bounds and verify old bounds. These binary/ternary covering codes can be used as systems for the football pool game. The results include a new binary code with covering radius 1 proving K2(13, 1) ≤ 736, and the following upper bound for the football pool problem for 9 matches: K3 (9, 1) ≤ 1356.
引用
收藏
页码：151 / 178
页数：27
相关论文
共 41 条
  • [21] Kamps H.J.L., Van Lint J.H., A covering problem, Colloq. Math. Soc. János Bolyai, 4, pp. 679-685, (1970)
  • [22] Kolev E., Landgev I., On some mixed covering codes of small length, Lecture Notes in Computer Science, 781, pp. 38-50, (1994)
  • [23] Van Laarhoven P.J.M., Aarts E.H.L., Van Lint J.H., Wille L.T., New upper bounds for the football pool problem for 6, 7, and 8 matches, J. Combin. Theory Ser. A, 52, pp. 304-312, (1989)
  • [24] Lindstrom B., Group partitions and mixed perfect codes, Canad. Math. Bull., 18, pp. 57-60, (1975)
  • [25] Van Lint Jr. J.H., Van Wee G.J.M., Generalized bounds on binary/ternary mixed packing- and covering codes, J. Combin. Theory Ser. A, 57, pp. 130-143, (1991)
  • [26] Van Lint Jr. J.H., Covering Radius Problems, (1988)
  • [27] Ostergard P.R.J., A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory, 37, pp. 179-180, (1991)
  • [28] Ostergard P.R.J., Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory, 37, pp. 660-664, (1991)
  • [29] IEEE Trans. Inform. Theory, 37, (1991)
  • [30] Ostergard P.R.J., Further results on (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, 38, pp. 206-210, (1992)
12345