1,2

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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.

P. R. J. Ostergard and U. Blass, On the size of optimal binary codes of length 9 and covering radius 1, IEEE Trans. Inform. Theory, 47 (2001), 2556-2557. [Determines a(9)].

Index entries for sequences related to covering codes

A column of A060438. Cf. A029866.

Sequence in context: A094686 A095054 A032162 this_sequence A095325 A153970 A067953

Adjacent sequences: A000980 A000981 A000982 this_sequence A000984 A000985 A000986

nonn,hard,nice

N. J. A. Sloane (njas(AT)research.att.com).