Codes for deletion and insertion channels with segmented errors

Authors:
Zhenming Liu;Michael Mitzenmacher
Affiliations:
School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

Finding maximum independent sets in graphs arising from coding theory

Proceedings of the 2002 ACM symposium on Applied computing
Insertion/deletion correction with spectral nulls

IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions

IEEE Transactions on Information Theory
On information transmission over a finite buffer channel

IEEE Transactions on Information Theory
On Lower Bounds for the Capacity of Deletion Channels

IEEE Transactions on Information Theory
A Simple Lower Bound for the Capacity of the Deletion Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of b 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.