Systematic Single-Deletion Multiple-Substitution Correcting Codes
share
Although studying in multiple-deletion correcting codes has made great progress in recent years, studying in codes correcting multiple deletions and substitutions simultaneously still in its beginning. Recent work by Smagloy et al. [12] gives a construction of single-deletion and single-substitution codes with redundancy 6log n + 8, where n is the length of the codes. In this paper, we propose a family of systematic 1-deletion s-substitution correcting code with asymptotical redundancy at most 4(s+1)log n+o(logn) for constant s such that s>=1.
READ FULL TEXT