A Caltech Library Service

Concatenated Polar codes

Bakshi, Mayank and Jaggi, Sidharth and Effros, Michelle (2010) Concatenated Polar codes. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT). IEEE International Symposium on Information Theory . IEEE , New York, pp. 918-922. ISBN 978-1-4244-7890-3.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


Polar codes have attracted much recent attention as one of the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed designs improve the probability of error at the cost of significantly increased computational complexity. In this work we show how the the classical idea of code concatenation – using “short” polar codes as inner codes and a “high-rate” Reed-Solomon code as the outer code – results in substantially improved performance. In particular, code concatenation with a careful choice of parameters boosts the rate of decay of the probability of error to almost exponential in the block-length with essentially no loss in computational complexity. We demonstrate such performance improvements for three sets of information-theoretic problems – a classical point-to-point channel coding problem, a class of multiple-input multiple output channel coding problems, and some network source coding problems.

Item Type:Book Section
Related URLs:
Additional Information:© 2010 IEEE. Issue Date: 13-18 June 2010. Date of Current Version: 23 July 2010. This work was supported in part by RGC GRF grants 412608 and 412809, RGC AoE grant on Institute of Network Coding, established under the University Grant Committee of Hong Kong, CUHK MoE-Microsoft Key Laboratory of Humancentric Computing and Interface Technologies, DARPA ITMANET program under grant W911NF-07-1-0029, and Caltech’s Lee Center for Advanced Networking. The authors gratefully thank Emre Telatar, Satish Korada, and Rüdiger Urbanke for introducing us to the elegant work on polar codes and patiently explaining vexing details.
Funding AgencyGrant Number
University Grants Committee General Research Fund (GRF)412608
University Grants Committee General Research Fund (GRF)412809
Hong Kong University Grant Committee Institute of Network CodingUNSPECIFIED
Humancentric Computing and Interface Technologies CUHK MoE-Microsoft Key LaboratoryUNSPECIFIED
Defense Advanced Research Projects Agency (DARPA) ITMANET ProgramW911NF-07-1-0029
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number11434206
Series Name:IEEE International Symposium on Information Theory
Record Number:CaltechAUTHORS:20110331-091110603
Persistent URL:
Official Citation:Bakshi, M.; Jaggi, S.; Effros, M.; , "Concatenated Polar codes," Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on , vol., no., pp.918-922, 13-18 June 2010 doi: 10.1109/ISIT.2010.5513508 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:23185
Deposited By: Tony Diaz
Deposited On:25 May 2011 19:37
Last Modified:03 Oct 2019 02:44

Repository Staff Only: item control page