On the List Decodability of Insertions and Deletions

In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary codes of rate \Omega (1) that are list-decodable from a 0.707...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2020-09, Vol.66 (9), p.5335-5343
Hauptverfasser:	Hayashi, Tomohiro, Yasunaga, Kenji
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Binary codes Codes Decoding DNA Encoding Hamming distance insertion and deletion Johnson bound Levenshtein metric List decoding Measurement Plotkin bound Upper bound Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!