Repeated communication and Ramsey graphs

We study the savings afforded by repeated use in two zero-error communication problems. We show that for some random sources, communicating one instance requires arbitrarily many bits, but communicating multiple instances requires roughly 1 bit per instance. We also exhibit sources where the number...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 1995-09, Vol.41 (5), p.1276-1289
Hauptverfasser:	Alon, N., Orlitsky, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Codes Communication channels Cryptography Graph theory Information technology
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!