| n\d | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 1 | 4 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 13 | 4 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 40 | 10 | 4 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 4 | 121 | 31 | 8 | 4 | 1 | 1 | 1 | 1 | 1 | 1 |
| 5 | 364 | 91 | 17 | 6 | 4 | 1 | 1 | 1 | 1 | 1 |
| 6 | 1093 | 274 | 36-52 | 14 | 5 | 4 | 1 | 1 | 1 | 1 |
| 7 | 3280 | 820 | 79-157 | 22-43 | 9 | 4 | 4 | 1 | 1 | 1 |
| 8 | 9841 | 2461 | 195-472 | 44-130 | 16-28 | 8-13 | 4 | 4 | 1 | 1 |
| 9 | 29524 | 7381 | 477-1417 | 94-391 | 26-85 | 13-40 | 7-13 | 4 | 4 | 1 |
| 10 | 88573 | 22144 | 1134-4252 | 203-1174 | 50-256 | 19-121 | 10-40 | 6-13 | 4-13 | 4 |
The above table shows E3(n,d), the number of codewords in an optimal ternary code of minimum edit distance d, and for which n is the length of the longest codeword. Where exact values are not known, upper and lower bounds are provided.
The earliest version of this table appeared in: S.Baker, R.Flack and S.Houghten, "Optimal Variable-Length Insertion-Deletion Correcting Codes and Edit Metric Codes", Congressus Numerantium 186 (2008), 65-80.
If you have improvements, comments, etc, please e-mail houghten@brocku.ca
This page last modified 5th August 2008 © Copyright Sheridan Houghten, 2005-2008