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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / IEEE International Symposium on Information Theory pp. 316 - 320
Main Authors: Sahebi, Aria G., Pradhan, S. Sandeep
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2014
Subjects:
Channel coding
Decoding
Memoryless systems
Random variables
Source coding
ISSN:2157-8095
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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