Published November 1, 1999
| public
Journal Article
Open
Asymptotically good codes correcting insertions, deletions, and transpositions
- Creators
-
Schulman, Leonard J.
- Zuckerman, David
Abstract
We present simple, polynomial time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions, and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion.
Additional Information
© Copyright 1999 IEEE. Reprinted with permission. Manuscript received April 13, 1997; revised October 16, 1998. This work was supported in part by NSF NYI under Grant CCR-9457799, a David and Lucile Packard Fellowship for Science and Engineering, and an Alfred P. Sloan Research Fellowship. The authors wish to thank the anonymous referees for their helpful comments.Files
SCHUieeetit99.pdf
Files
(193.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:ecc535acfde1207513cd56ac61514bf0
|
193.3 kB | Preview Download |
Additional details
- Eprint ID
- 6720
- Resolver ID
- CaltechAUTHORS:SCHUieeetit99
- Created
-
2006-12-19Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field