Codes for Deletion and Insertion Channels with Segmented Errors
View/ Open
Metadata
Show full item recordCitation
Liu, Zhenming and Michael Mitzenmacher. 2006. Codes for Deletion and Insertion Channels with Segmented Errors. Harvard Computer Science Group Technical Report TR-21-06.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.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:25811013
Collections
- FAS Scholarly Articles [18292]
Contact administrator regarding this item (to report mistakes or request changes)