Zero-error list capacities of discrete memoryless channels

Zero-error list capacities of discrete memoryless channels

We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-letter one. Nonetheless, we exhibit a class of ch...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1997-11, Vol.43 (6), p.1977-1982
1. Verfasser: Telatar, I.E.
Format: Artikel
Sprache:eng
Schlagworte:
Block codes
Codes
Communication systems
Communications
Decoding
Delay
Information theory
Memoryless systems
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-letter one. Nonetheless, we exhibit a class of channels for which a single letter characterization exists. We also show how the computational cutoff rate relates to the capacities we have defined.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.641560