Performance and construction of polar codes on symmetric binary-input memoryless channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Modern Coding Theory
Rate-adaptive polar codes for distributed source coding
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
The exponent of a polarizing matrix constructed from the Kronecker product
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Polar coding, proposed by Arikan, makes it possible to construct capacity-achieving codes for symmetric binary-input discrete memoryless channels, with low encoding and decoding complexity. Complexity of the originally proposed code construction method, however, grows exponentially in the blocklength unless a channel is the binary erasure channel. Recently, the authors have proposed a new capacity-achieving code construction method with linear complexity in the blocklength for arbitrary symmetric binary-input memoryless channels. In this letter, we evaluate performance of polar codes designed with the new construction method, and compare it with that of the codes constructed with another heuristic method with linear complexity proposed by Arikan.