|
| |
|
|
A070979
|
|
Triangle read by rows giving size of minimal asymmetric covering code of length n and radius R.
|
|
0
| |
|
|
1, 2, 1, 3, 2, 1, 6, 3, 2, 1, 10, 5, 3, 2, 1, 18, 8, 4, 3, 2, 1, 31
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Minimal binary code C of length n such that every vector of length n can be obtained from a codeword by changing at most R 1's to 0's.
|
|
|
REFERENCES
| J. N. Cooper, R. B. Ellis and A. B. Kahng, Asymmetric binary covering codes, J. Comb. Theory Ser. A, Vol. 100, no. 2 (2002), 232-249.
|
|
|
LINKS
| D. Applegate, E. M. Rains and N. J. A. Sloane, On asymmetric coverings and covering numbers, J. Comb. Des. 11 (2003), 218-228.
R. B. Ellis, Asymmetric Covering Codes.
|
|
|
EXAMPLE
| n=5, R=2: C={11111,01111,10011,11100,00011}
|
|
|
CROSSREFS
| Cf. A066000, A019436.
Sequence in context: A064861 A191528 A191788 * A054098 A132089 A185624
Adjacent sequences: A070976 A070977 A070978 * A070980 A070981 A070982
|
|
|
KEYWORD
| hard,nice,nonn,tabl
|
|
|
AUTHOR
| Joshua N. Cooper (jcooper(AT)math.ucsd.edu), May 17 2002
|
| |
|
|
