Polar Code Moderate Deviation: Recovering the Scaling Exponent
Hsin-Po Wang, Iwan Duursma

TL;DR
This paper investigates the moderate deviation regime of polar codes, connecting it to the scaling exponent regime, and provides new theoretical insights into the relationship between block length, error probability, and capacity gap.
Contribution
It establishes that the latest moderate deviation results imply the scaling exponent regime, bridging a gap in the theoretical understanding of polar code polarization.
Findings
Latest moderate deviation results imply the scaling exponent regime
Provides a unified framework linking different polarization regimes
Enhances understanding of the trade-offs in polar code design
Abstract
In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summarize as follows: (a) From the root channel synthesize recursively a series of channels . (b) Select sophisticatedly a subset of synthetic channels. (c) Transmit information using synthetic channels indexed by and freeze the remaining synthetic channels. Arikan gives each synthetic channel a score (called the Bhattacharyya parameter) that determines whether it should be selected or frozen. As grows, a majority of the scores are either very high or very low, i.e., they polarize. By characterizing how fast they polarize, Arikan showed that polar coding is able to produce a series of codes that achieve capacity on symmetric binary-input memoryless channels. In measuring how the scores polarize the relation among block length, gap to capacity, and block error probability are…
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
TopicsError Correcting Code Techniques · DNA and Biological Computing · Wireless Communication Security Techniques
