A Class of Transformations that Polarize Binary-Input Memory less Channels
2009
Abstract
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.
Details
Title
A Class of Transformations that Polarize Binary-Input Memory less Channels
Author(s)
Korada, Satish Babu ; Sasoglu, Eren
Published in
2009 Ieee International Symposium On Information Theory
Pages
1478-1482
Conference
IEEE International Symposium on Information Theory (ISIT 2009), Seoul, SOUTH KOREA, Jun 28-Jul 03, 2009
Date
2009
Publisher
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
Other identifier(s)
View record in Web of Science
Laboratories
LTHC
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LTHC - Communication Theories Laboratory
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date
2010-11-30