Performance and construction of polar codes on symmetric binary-input memoryless channels

Authors:
Ryuhei Mari;Toshiyuki Tanaka
Affiliations:
Department of Systems Science, Kyoto University, Kyoto, Japan;Department of Systems Science, Kyoto University, Kyoto, Japan
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 1
Cited 3

Modern Coding Theory

Modern Coding Theory

Performance of polar codes with the construction using density evolution

IEEE Communications Letters
Rate-adaptive polar codes for distributed source coding

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
High performance error correction for quantum key distribution using polar codes

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the original paper, the construction complexity is exponential in the blocklength. In this paper, a new construction method for arbitrary symmetric binary memoryless channel (B-MC) with linear complexity in the blocklength is proposed. Furthermore, new upper bound and lower bound of the block error probability of polar codes are derived for the BEC and arbitrary symmetric B-MC, respectively.