Key points are not available for this paper at this time.
In this paper, we construct two rate efficient codes of length n named as marker-MDS and marker-SVT codes which correct a burst of deletions/insertions of length b (error-free decoding), where b is not necessarily fixed as a constant but is proportional to n , i.e., b = tn , 0 t n is not smaller than a lower bound f ( t ) which is determined by t .
Yi et al. (Mon,) studied this question.