Asymptotically good codes correcting insertions, deletions, and transpositions

Authors:
L. J. Schulman;D. Zuckerman
Affiliations:
Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA;-
Venue:
IEEE Transactions on Information Theory
Year:
1999

Citing 0
Cited 11

Collusion Secure q-ary Fingerprinting for Perceptual Content

DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Reconstructing strings from random traces

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improved string reconstruction over insertion-deletion channels

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Survey of Results for Deletion Channels and Related Synchronization Channels

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Esense: communication through energy sensing

Proceedings of the 15th annual international conference on Mobile computing and networking
Simplification of packet-symbol decoding with errors, deletions, misordering of packets, and no sequence numbers

IEEE Transactions on Information Theory
Convolutional decoding in the presence of synchronization errors

IEEE Journal on Selected Areas in Communications
Steganographic communication in ordered channels

IH'06 Proceedings of the 8th international conference on Information hiding
Privacy amplification with asymptotically optimal entropy loss

Proceedings of the forty-second ACM symposium on Theory of computing
Spectrum of Sizes for Perfect Deletion-Correcting Codes

SIAM Journal on Discrete Mathematics
Less haste, less waste: on recycling and its limits in strand displacement systems

DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming

Quantified Score

Hi-index	754.90

Visualization

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