Recovering a Message from an Incomplete Set of Noisy Fragments

We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of the fragments. Such a channel is motivated by applications in molecular data storage and forensics, and we refer to it...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-07
Hauptverfasser:	Aditya Narayan Ravi, Vahid, Alireza, Shomorony, Ilan
Format:	Artikel
Sprache:	eng
Schlagworte:	Communication Data storage Fragments Lower bounds Messages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!