|
Search: id:A066000
|
|
|
| A066000 |
|
Size of smallest directed 1-covering code of length n. |
|
+0
3
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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
|
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: A077930 A023359 A082482 this_sequence A011957 A019436 A147852
Adjacent sequences: A065997 A065998 A065999 this_sequence A066001 A066002 A066003
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 07 2001
|
|
|
Search completed in 0.002 seconds
|
