A New Table of Binary/Ternary Mixed Covering Codes |
| |
Authors: | Patric R. J. Östergård Heikki O. Hämäläinen |
| |
Affiliation: | (1) Department of Computer Science, Helsinki University of Technology, 02150 Espoo, Finland;(2) Lehtotie 28, 41120 Puuppola, Finland |
| |
Abstract: | 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. |
| |
Keywords: | covering codes football pool problem mixed codes simulated annealing |
本文献已被 SpringerLink 等数据库收录! |
|