Polar Codes for Broadcast Channels

DOI10.1109/TIT.2014.2378172zbMATH Open1359.94486arXiv1301.6150OpenAlexW3098078190MaRDI QIDQ2978765FDOQ2978765

Authors: Naveen Goela, Emmanuel Abbe, Michael C. Gastpar 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy broadcast channels, polar implementations are presented for two information-theoretic schemes: i) Cover's superposition codes; ii) Marton's codes. Due to the structure of polarization, constraints on the auxiliary and channel-input distributions are identified to ensure proper alignment of polarization indices in the multi-user setting. The codes achieve rates on the capacity boundary of a few classes of broadcast channels (e.g., binary-input stochastically degraded). The complexity of encoding and decoding is $O(n\ast logn)$ where $n$ is the block length. In addition, polar code sequences obtain a stretched-exponential decay of $$ of the average block error probability where $$.

Full work available at URL: https://arxiv.org/abs/1301.6150

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Cited In (3)

• Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
• Polar Coding for Secret-Key Generation
• Polar Coding for Non-Stationary Channels

This page was built for publication: Polar Codes for Broadcast Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978765)