%I A000983 M0329 N0124
%S A000983 1,2,2,4,7,12,16,32,62
%N A000983 Size of minimal covering code of length n and covering radius 1 (the
next term is in the range 105-120).
%D A000983 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A000983 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973
(includes this sequence).
%D A000983 G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 166.
%D A000983 H. Hamalainen et al., Football pools - a game for mathematicians, Amer.
Math. Monthly, 102 (1995), 579-588.
%D A000983 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.
%D A000983 J. G. Kalbfleisch and R. G. Stanton, A combinatorial problem in matching,
J. London Math. Soc., 44 (1969), 60-64.
%D A000983 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.
%D A000983 P. R. J. Ostergard and M. K. Kaikkonen, New upper bounds for binary covering
codes, Discrete Mathematics 178 (1998), 165-179.
%H A000983 P. R. J. Ostergard and U. Blass, <a href="http://citeseer.nj.nec.com/
442443.html">On the size of optimal binary codes of length 9 and
covering radius 1</a>, IEEE Trans. Inform. Theory, 47 (2001), 2556-2557.
[Determines a(9)].
%H A000983 <a href="Sindx_Coa.html#covcod">Index entries for sequences related to
covering codes</a>
%Y A000983 A column of A060438. Cf. A029866.
%Y A000983 Sequence in context: A094686 A095054 A032162 this_sequence A095325 A153970
A067953
%Y A000983 Adjacent sequences: A000980 A000981 A000982 this_sequence A000984 A000985
A000986
%K A000983 nonn,hard,nice
%O A000983 1,2
%A A000983 N. J. A. Sloane (njas(AT)research.att.com).
|