General Strong Polarization

DOI10.1145/3491390zbMath1489.94183arXiv1802.02718OpenAlexW4214869020MaRDI QIDQ5066948

Jarosław Błasiok, Preetum Nakkiran, Atri Rudra, Madhu Sudan, Venkatesan Guruswami

Publication date: 31 March 2022

Published in: Journal of the ACM, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

polarizationpolar codescapacity-achieving codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items

General Strong Polarization, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The coding of messages subject to chance errors
• Polarization and Polar Codes
• Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors
• List Decoding of Polar Codes
• Polar Codes for Broadcast Channels
• Polar Codes: Speed of Polarization and Polynomial Gap to Capacity
• Improved Bounds on the Finite Length Scaling of Polar Codes
• Finite-Length Scaling for Polar Codes
• Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices
• Polar Codes for the $m$-User Multiple Access Channel
• Probability
• An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets
• Accuracy and Stability of Numerical Algorithms
• Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Polar Codes’ Simplicity, Random Codes’ Durability
• General Strong Polarization
• Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity
• Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• Polar Codes: Characterization of Exponent, Bounds, and Constructions
• How to Construct Polar Codes
• Polar Codes for the Two-User Multiple-Access Channel