A Characterization of the Number of Subsequences Obtained via the Deletion Channel

Motivated by the study of deletion channels, this paper presents improved bounds on the number of subsequences obtained from a binary string X of length n under t deletions. It is known that the number of subsequences in this setting strongly depends on the number of runs in the string X; where a ru...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2015-05, Vol.61 (5), p.2300-2312
Hauptverfasser:	Liron, Yuvalal, Langberg, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary system Computer science Electrical engineering Electronic mail Information theory Mathematical analysis Polynomials Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!