Performance of Polar Codes for Channel and Source Coding

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, 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.


Published in:
Proceedings of the IEEE International Symposium on Information Theory , 1488--1492
Presented at:
IEEE. International Symposium of Information Theory 2009, Seoul, June 28- July 3
Year:
2009
Keywords:
Laboratories:




 Record created 2009-05-15, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)