Improved Bounds on the Finite Length Scaling of Polar Codes
Information Theory
2013-07-23 v1 math.IT
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 where is the code rate and the symmetric capacity of the channel, . The results are then extended to polar lossy source coding at rate of a source with symmetric distortion-rate function . The blocklength required scales at most as where is the actual distortion.
Keywords
Cite
@article{arxiv.1307.5510,
title = {Improved Bounds on the Finite Length Scaling of Polar Codes},
author = {Dina Goldin and David Burshtein},
journal= {arXiv preprint arXiv:1307.5510},
year = {2013}
}
Comments
submitted for publication, IEEE Transactions on Information Theory