Polar Codes for Some Multi-terminal Communications Problems
classification
💻 cs.IT
math.IT
keywords
codingarbitrarycommunicationsmulti-terminalmultiplepolarproblemsaccess
read the original abstract
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 nonbinary) and arbitrary distributions (symmetric or asymmetric).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.