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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings / IEEE International Symposium on Information Theory s. 316 - 320
Hlavní autoři: Sahebi, Aria G., Pradhan, S. Sandeep
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2014
Témata:
Channel coding
Decoding
Memoryless systems
Random variables
Source coding
ISSN:2157-8095
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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