Performance of polar codes for channel and source coding

Authors:
Nadine Hussami;Satish Babu Korada;Rüdiger Urbanke
Affiliations:
AUB, Lebanon;EPFL, Switzerland;EPFL, Switzerland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 3
Cited 3

Codes on graphs: normal realizations

IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning

IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory

Polar codes are optimal for lossy source coding

IEEE Transactions on Information Theory
Rate-adaptive polar codes for distributed source coding

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.06

Visualization

Abstract

Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, com bined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking. We discuss several techniques through which their finite-length performance can be improved. We also study the performance of these codes in the context of source coding, both loss less and lossy, in the single-user context as well as for distributed applications.