Codes for deletion and insertion channels with segmented errors

Zhenming Liu, Michael Mitzenmacher

Abstract: We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</i> consecutive bits, with at most one error per segment. Under this assumption, we demonstrate simple and computationally efficient deterministic encoding and decoding schemes that achieve a high provable rate even under worst case errors. We also consider more complex schemes that experimentally achieve higher rates under random error.