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 条
  • [41] Improved upper bound on the complementary error function
    Zhang, Zhimin
    Fang, Jinpan
    Lin, Jaduo
    Zhao, Shancheng
    Xiao, Fengjun
    Wen, Jinming
    ELECTRONICS LETTERS, 2020, 56 (13) : 663 - 665
  • [42] An improved upper bound on the spectral radius of graphs
    Wang, Xinxia
    Wang, Yuanfei
    Shu, Jinlong
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 922 - 924
  • [43] An improved upper bound and algorithm for clique covers
    McIntyre, Ryan
    Soltys, Michael
    JOURNAL OF DISCRETE ALGORITHMS, 2018, 48 : 42 - 56
  • [44] An improved upper bound for queens domination numbers
    Burger, AP
    Mynhardt, CM
    DISCRETE MATHEMATICS, 2003, 266 (1-3) : 119 - 131
  • [45] An Improved Upper Bound for the Universal TSP on the Grid
    Christodoulou, George
    Sgouritsa, Alkmini
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1006 - 1021
  • [46] An improved upper bound for Laplacian graph eigenvalues
    Das, KC
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 : 269 - 278
  • [47] Improved upper bound to the entropy of a charged system
    Hod, S
    PHYSICAL REVIEW D, 2000, 61 (02)
  • [48] An improved upper bound for the order of mixed graphs
    Dalfo, C.
    Fiol, M. A.
    Lopez, N.
    DISCRETE MATHEMATICS, 2018, 341 (10) : 2872 - 2877
  • [49] AN IMPROVED UPPER BOUND FOR FINITE DELAY OF GRAPHS
    VILFAN, B
    IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (05) : 453 - &
  • [50] Improved upper bound for sorting by short swaps
    Feng, X
    Meng, Z
    Sudborough, IH
    I-SPAN 2004: 7TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2004, : 98 - 103
12345