Asymptotically good codes correcting insertions, deletions, and transpositions
From MaRDI portal
Publication:4503483
DOI10.1109/18.796406zbMath0960.94037OpenAlexW2029448413MaRDI QIDQ4503483
Leonard J. Schulman, David Zuckerman
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit99
asymptotically good codesinsertion-deletionexponential error probabilitypolynomial-time encodable and decodable codes
Related Items
On the Varshamov-Tenengolts construction on binary strings, Insdel codes from subspace and rank-metric codes, Efficient Linear and Affine Codes for Correcting Insertions/Deletions, Unnamed Item, Privacy amplification with asymptotically optimal entropy loss, Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems, Feedback insertion-deletion codes