A Class of Transformations that Polarize Binary-Input Memory less Channels
A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x 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.
- View record in Web of Science
Record created on 2010-11-30, modified on 2016-08-09