This page is the electronic distribution for the codes presented in:
Constructing asymmetric covering codes by tabu search, P. R. J. Östergård and E. A. Seuranen, Journal of Combinatorial Mathematics and Combinatorial Computing 51 (2004), 165-173.

The upper bounds listed here are not necessary up to date, since no modifications have been done after the paper was submitted (Oct 8 2003).

See also our further results on asymmetric covering codes.

Asymmetric covering codes are given by their decimal value (i.e. 11 in decimal is ...001011 in binary). The covering code files have the following format:

1         ; 1st line - R
8         ; 2nd line - n
2         ; 3rd line - q
58        ; 4th line - the cardinality of the code
          ; the codewords in one or more lines

The exact bounds are indicated with a period. The new upper bounds presented in the paper are linked to the code attaining the bound; for the other bounds see the references in the paper.

R \ n 1 2 3 4 5 6 7 8 9 10 11 12 13
1 1. 2. 3. 6. 10. 18. 31. 58. 106 196 352 668 1253
2 1. 1. 2. 3. 5. 8. 14 23 40
70 121
218
421
3 1. 1. 1. 2. 3. 4. 7 12 19 31
51
92
165
4 1. 1. 1. 1. 2. 3. 4. 6. 10 15
25 42 71
5 1. 1. 1. 1. 1. 2. 3. 4. 6. 8.
13
21 35
6 1. 1. 1. 1. 1. 1. 2. 3. 4. 5. 8 12
18
7 1. 1. 1. 1. 1. 1. 1. 2. 3. 4. 5. 7. 11
8 1. 1. 1. 1. 1. 1. 1. 1. 2. 3. 4. 5. 7.
9 1. 1. 1. 1. 1. 1. 1. 1. 1. 2. 3. 4. 5.
10 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 2. 3. 4.
11 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 2. 3.
12 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 2.
13 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1.