A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels

DOI10.1109/TIT.2016.2582843MaRDI QIDQ2976614zbMATH OpenFDO

Authors Mine Alsan, İ. Emre Telatar

Publication date 28 April 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2016.2582843

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• A Note on Some Inequalities Used in Channel Polarization and Polar Coding
• Polar Coding for Non-Stationary Channels
• Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels
• Polar Codes for the m-User Multiple Access Channel
• Polar Decomposition of Mutual Information Over Complex-Valued Channels
• Construction of Polar Codes for Arbitrary Discrete Memoryless Channels
• Polar Codes for the Two-User Multiple-Access Channel
• Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
• On Polar Coding for Side Information Channels

This page was built for publication: A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels

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