Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions

We consider the problem of designing low-redundancy codes in settings where one must correct deletions in conjunction with substitutions or adjacent transpositions; a combination of errors that is usually observed in DNA-based data storage. One of the most basic versions of this problem was settled...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 69; no. 1; pp. 169 - 186
Main Authors:	Gabrys, Ryan, Guruswami, Venkatesan, Ribeiro, Joao, Wu, Ke
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Binary codes Codes Computer Science Data storage Decoding Deletion efficient encoding/decoding Encoding Engineering Error correction optimal codes Redundancy Sketches Substitutes Synchronization errors Termination of employment
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!