On the rate of channel polarization

Authors:
Erdal Arıkan;Emre Telatar
Affiliations:
Department of Electrical-Electronics Engineering, Bilkent University, Ankara, TR, Turkey;Information Theory Laboratory, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 0
Cited 4

Polar codes are optimal for lossy source coding

IEEE Transactions on Information Theory
Nested polar codes for wiretap and relay channels

IEEE Communications Letters
Polar codes: characterization of exponent, bounds, and constructions

IEEE Transactions on Information Theory
The exponent of a polarizing matrix constructed from the Kronecker product

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.12

Visualization

Abstract

A bound is given on the rate of channel polarization. As a corollary, an earlier bound on the probability of error for polar coding is improved. Specifically, it is shown that, for any binary-input discrete memoryless channel W with symmetric capacity I(W) and any rate R I(W), the polar-coding block-error probability under successive cancellation decoding satisfies Pe(N,R) ≤ 2-Nβ for any β N is large enough.