Polar codes for some multi-terminal communications problems

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The results are valid for arbitrary alphabet sizes (binary or non-b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings / IEEE International Symposium on Information Theory S. 316 - 320
Hauptverfasser: Sahebi, Aria G., Pradhan, S. Sandeep
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2014
Schlagworte:
Channel coding
Decoding
Memoryless systems
Random variables
Source coding
ISSN:2157-8095
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The results are valid for arbitrary alphabet sizes (binary or non-binary) and arbitrary distributions (symmetric or asymmetric).
ISSN:2157-8095
DOI:10.1109/ISIT.2014.6874846