Interleaved constrained codes with markers correcting bursts of insertions or deletions

Abstract: We present the construction of interleaving arrays for correcting clusters as well as diffuse bursts of insertion or deletion errors in constrained data. In this construction, a constrained information sequence is systematically encoded by computing a small number of parity checks and inserting markers such that the resulting code word is also constrained. Insertions and deletions lead to a shift between successive markers which can thus be detected and recovered using the parity checks. In this paper, as an example, the scheme is developed for Manchester-encoded information sequences