Improved Bounds on the Finite Length Scaling of Polar Codes

preprint2013arXivOpen access

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)O((I(W)-R)^{-5.77}) where RR is the code rate and I(W)I(W) the symmetric capacity of the channel, WW. The results are then extended to polar lossy source coding at rate RR of a source with symmetric distortion-rate function D(⋅)D(\cdot). The blocklength required scales at most as O((DN−D(R))−5.77)O((D_N-D(R))^{-5.77}) where DND_N is the actual distortion.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.