An improved upper bound for the football pool problem for nine matches

被引：1
|
作者：
Di Pasquale, F [1 ]
Östergård, PRJ [1 ]
机构：
[1] Helsinki Univ Technol, Dept Elect & Commun Engn, Espoo, Finland
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 2003年 / 102卷 / 01期
关键词：
automorphism group; covering code; football pool problem;
D O I：
10.1016/S0097-3165(03)00010-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The problem of determining K-3(n, 1), the minimum size of a ternary code of length n and covering radius 1, is called the football pool problem. By construction, it is here shown that K-3(9, 1) less than or equal to 1269. A code whose full automorphism group has order 648 is given, but this bound is actually achieved by a vast number of inequivalent codes. (C) 2003 Elsevier Science (USA). All rights reserved.
引用
收藏
页码：204 / 206
页数：3
相关论文
共 50 条
  • [21] Thrackles: An improved upper bound
    Fulek, Radoslav
    Pach, Janos
    DISCRETE APPLIED MATHEMATICS, 2019, 259 : 226 - 231
  • [22] An improved upper bound for SAT
    Chu, Huairui
    Xiao, Mingyu
    Zhang, Zhe
    THEORETICAL COMPUTER SCIENCE, 2021, 887 : 51 - 62
  • [23] Graph domination, tabu search and the football pool problem
    Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA 15215, United States
    不详
    Discrete Appl Math, 3 (217-228):
  • [24] Graph domination, tabu search and the football pool problem
    Davies, R
    Royle, GF
    DISCRETE APPLIED MATHEMATICS, 1997, 74 (03) : 217 - 228
  • [25] AN UPPER BOUND IN GOLDBACH PROBLEM
    DESHOUILLERS, JM
    GRANVILLE, A
    NARKIEWICZ, W
    POMERANCE, C
    MATHEMATICS OF COMPUTATION, 1993, 61 (203) : 209 - 213
  • [26] On the Monotone Upper Bound Problem
    Pfeifle, J
    Ziegler, GM
    EXPERIMENTAL MATHEMATICS, 2004, 13 (01) : 1 - 11
  • [27] AN IMPROVED UPPER BOUND FOR G(K) IN WARING PROBLEM FOR RELATIVELY SMALL K
    BALASUBRAMANIAN, R
    MOZZOCHI, CJ
    ACTA ARITHMETICA, 1984, 43 (03) : 283 - 285
  • [28] A note: An improved upper bound for the online inventory problem with bounded storage and order costs
    Dai, Wenqiang
    Jiang, Qingzhu
    Feng, Yi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (02) : 628 - 630
  • [29] AN IMPROVED UPPER BOUND ON COVERING RADIUS
    MATTSON, HF
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 228 : 90 - 106
  • [30] An improved upper bound on the queuenumber of the hypercube
    Hasunuma, Toru
    Hirota, Misa
    INFORMATION PROCESSING LETTERS, 2007, 104 (02) : 41 - 44
12345