Efficient Low-Redundancy Codes for Correcting Multiple Deletions

We consider the problem of constructing binary codes to recover from <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-bit deletions with efficient encoding/decoding, for a fixed <inline-formula> <tex-math notation="LaTeX"...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 64; no. 5; pp. 3403 - 3410
Main Authors:	Brakensiek, Joshua, Guruswami, Venkatesan, Zbarsky, Samuel
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	algebraic codes Binary codes Binary system Codes Coding theory Decoding Deletion edit distance Electronic mail hashing Linear codes Protocols pseudorandomness Redundancy synchronization errors
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!