A class of transformations that polarize binary-input memoryless channels

Authors:
Satish Babu Korada;Eren Sasoǧlu
Affiliations:
EPFL, I&C, LTHC, Lausanne, Switzerland;EPFL, I&C, LTHI, Lausanne, Switzerland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 4
Cited 1

Graph Theory

Graph Theory
Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels

IEEE Transactions on Information Theory
Bounds on information combining

IEEE Transactions on Information Theory
Extremes of information combining

IEEE Transactions on Information Theory

The exponent of a polarizing matrix constructed from the Kronecker product

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generalization of Arikan's polar code construction using transformations of the form G⊗n where G is an l × l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is shown that a large class of such transformations polarize binary-input memoryless channels.