A new lower bound for the football pool problem for $7$ matches

@article{Habsieger1996,
abstract = {Let $K_3 (7,1)$ denote the minimum cardinality of a ternary code of length $7$ and covering radius one. In a previous paper, we improved on the lower bound $K_3(7,1) \ge 147$ by showing that $K_3(7,1) \ge 150$. In this note, we prove that $K_3(7,1) \ge 153$.},
author = {Habsieger, Laurent},
journal = {Journal de théorie des nombres de Bordeaux},
keywords = {ternary code; covering radius},
language = {eng},
number = {2},
pages = {481-484},
publisher = {Université Bordeaux I},
title = {A new lower bound for the football pool problem for $7$ matches},
url = {http://eudml.org/doc/247830},
volume = {8},
year = {1996},
}

TY - JOUR
AU - Habsieger, Laurent
TI - A new lower bound for the football pool problem for $7$ matches
JO - Journal de théorie des nombres de Bordeaux
PY - 1996
PB - Université Bordeaux I
VL - 8
IS - 2
SP - 481
EP - 484
AB - Let $K_3 (7,1)$ denote the minimum cardinality of a ternary code of length $7$ and covering radius one. In a previous paper, we improved on the lower bound $K_3(7,1) \ge 147$ by showing that $K_3(7,1) \ge 150$. In this note, we prove that $K_3(7,1) \ge 153$.
LA - eng
KW - ternary code; covering radius
UR - http://eudml.org/doc/247830
ER -