Performance of Polar Codes for Channel and Source Coding
Information Theory
2009-05-22 v2 math.IT
Abstract
Polar codes, introduced recently by Ar\i kan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined 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 lossless and lossy, in the single-user context as well as for distributed applications.
Keywords
Cite
@article{arxiv.0901.2370,
title = {Performance of Polar Codes for Channel and Source Coding},
author = {Nadine Hussami and Satish Babu Korada and Rudiger Urbanke},
journal= {arXiv preprint arXiv:0901.2370},
year = {2009}
}
Comments
accepted in ISIT 2009, Figure 5 is different from the previous version