|
REFERENCES
|
G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 166.
H. Hamalainen et al., Football pools - a game for mathematicians, Amer. Math. Monthly, 102 (1995), 579-588.
I. S. Honkala and P. R. J. Ostergard, Code design, Chapter 13 of Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra (editors), Wiley, New York 1997, pp. 441-456.
J. G. Kalbfleisch and R. G. Stanton, A combinatorial problem in matching, J. London Math. Soc., 44 (1969), 60-64.
A. Lobstein, G. Cohen and N. J. A. Sloane, Recouvrements d'Espaces de Hamming Binaires, C. R. Acad. Sci. Paris, Series I, 301 (1985), 135-138.
P. R. J. Ostergard and M. K. Kaikkonen, New upper bounds for binary covering codes, Discrete Mathematics 178 (1998), 165-179.
|
