Improved Bounds on the Finite Length Scaling of Polar Codes

Abstract

Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as O((I(W)-R)-5.77) where R is the code rate and I(W) the symmetric capacity of the channel, W. The results are then extended to polar lossy source coding at rate R of a source with symmetric distortion-rate function D(·). The blocklength required scales at most as O((DN-D(R))-5.77) where DN is the actual distortion.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…