On the scaling of Polar Codes: II. The behavior of un-polarized channels
S. Hamed Hassani, Kasra Alishahi, Rudiger Urbanke

TL;DR
This paper analyzes the behavior of unpolarized channels in polar codes over the binary erasure channel by establishing bounds on the rate at which sub-channels polarize, focusing on the probability of remaining unpolarized.
Contribution
It provides new upper and lower bounds on the escape rate of the Bhattacharyya process, quantifying the polarization speed of sub-channels.
Findings
Bounds on the exponent of unpolarized sub-channels
Quantitative characterization of the polarization process
Insights into the asymptotic behavior of the Bhattacharyya process
Abstract
We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes and transmission over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bhattacharyya constant falls in a fixed interval . Mathematically this can be stated as bounding the limit , where is the Bhattacharyya process. The quantity represents the fraction of sub-channels that are still un-polarized at time .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Error Correcting Code Techniques · DNA and Biological Computing
