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 条
12345