Optimal Deterministic Polynomial-Time Data Exchange for Omniscience

We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as side-information. Assuming that the collective information amo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Milosavljevic, Nebojsa, Pawar, Sameer, Rouayheb, Salim El, Gastpar, Michael, Ramchandran, Kannan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Cryptography and Security Computer Science - Information Theory Mathematics - Information Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!