A066000 Size of smallest directed 1-covering code of length n.

1, 2, 3, 6, 10, 18, 31, 58

Offset

1,2

Comments

Minimal binary code C of length n such that every vector of length n is either in the code or is obtained from a codeword by changing a single 1 to a 0.

Links

Table of n, a(n) for n=1..8.

D. Applegate, E. M. Rains and N. J. A. Sloane, On asymmetric coverings and covering numbers, J. Comb. Des. 11 (2003), 218-228.

E. M. Rains and N. J. A. Sloane, Examples of codes of lengths 1 through 8

Index entries for sequences related to covering codes

Example

n=4: C = {1111, 1110, 0111, 1001, 0100, 0010}.

Crossrefs

Cf. A019436.

Sequence in context: A357455 A357453 A082482 * A011957 A019436 A147852

Adjacent sequences: A065997 A065998 A065999 * A066001 A066002 A066003

Keyword

nonn,nice,more

Author

N. J. A. Sloane, Dec 07 2001

Status

approved