A combinatorial construction for perfect deletion-correcting codes
By a T*(2, k, v)-code we mean a perfect (k - 2)-deletion-correcting code of length k over an alphabet of size v. which is capable of correcting any combination of up to (k - 2) deletions and insertions of letters occured in transmission of codewords. In this paper, we provide a combinatorial construction fur T*(2, k, v)-codes. As an application, we show that a T*(2, 6, v)-code exists for all positive integers v not equivalent to 3 (mod 5), with at most 12 possible exceptions of v. In the procedure, a result on incomplete directed BIBDs is also established which is of interest in its own right.
construction code deletiun/insertion-correcting