Finite-Length Scaling of Polar Codes
S. Hamed Hassani, Kasra Alishahi, and Rudiger Urbanke

TL;DR
This paper investigates how the blocklength of polar codes must scale as the transmission rate approaches channel capacity to maintain a fixed error probability, providing bounds on the required length based on the sum of Bhattacharyya parameters.
Contribution
It establishes finite-length scaling laws for polar codes, quantifying how blocklength relates to rate and error probability near capacity, with explicit exponents.
Findings
Blocklength scales as (I(W)-R)^{-3.579} for lower bounds.
Blocklength scales as (I(W)-R)^{-6} for upper bounds.
Provides explicit constants depending on error probability and channel capacity.
Abstract
Consider a binary-input memoryless output-symmetric channel . Such a channel has a capacity, call it , and for any and strictly positive constant we know that we can construct a coding scheme that allows transmission at rate with an error probability not exceeding . Assume now that we let the rate tend to and we ask how we have to "scale" the blocklength in order to keep the error probability fixed to . We refer to this as the "finite-length scaling" behavior. This question was addressed by Strassen as well as Polyanskiy, Poor and Verdu, and the result is that must grow at least as the square of the reciprocal of . Polar codes are optimal in the sense that they achieve capacity. In this paper, we are asking to what degree they are also optimal in terms of their finite-length behavior. Our approach is…
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.
