A029866 Size of minimal binary covering code of length n and covering radius 2.

1, 2, 2, 2, 4, 7, 12, 16

Offset: 2

Author

N. J. A. Sloane

Keywords

• nonn
• more

Comments

Also the domination number of the (n+1)-halved cube graph. - Eric W. Weisstein, Aug 31 2016 and Jul 17 2017 (after discussion with Stan Wagon)

References

• G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 166.

Links

• R. Bertolo, Patric R. J. Östergård and W. D. Weakley, An updated table of binary/ternary mixed covering codes, J. Combin. Designs, 12 (2004), 157-176, DOI:10.1002/jcd.20008. [a(9)=16, bounds for n>9]
• Dmitry Kamenetsky, Best known solutions for n <= 11.
• Eric Weisstein's World of Mathematics, Domination Number
• Eric Weisstein's World of Mathematics, Halved Cube Graph
• Index entries for sequences related to covering codes

Crossrefs

A column of A060438.

Cf. A000983 (domination number of the n-hypercube graph Q_n).

Extensions

a(9) from Andrey Zabolotskiy, Sep 01 2016