A class of transformations that polarize binary-input memoryless channels

A generalization of Arıkan´s polar code construction using transformations of the form G^⊗n where G is an ℓ × ℓ 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.