论文部分内容阅读
There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where all coordinates must be different.We call these two kinds of codes T*(k-t, k, v)-codes and T(k-t, k, v)-codes respectively, which are both capable of correcting any combination of up to k-t deletions and insertions of letters occurred in transmission of codewords.