A Class of transformations that polarize binary-input memoryless channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1478-1482

  Korada, Satish Babu ^a   Şaşǒglu, Eren ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

L-MATRIX; LARGE CLASS; MEMORYLESS CHANNELS; POLAR CODES; SUFFICIENT CONDITIONS;

INFORMATION THEORY;

EID: 70449495631     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205864     Document Type: Conference Paper

References (6)

1. E. Arikan, "Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels," submitted to IEEE Trans. Inform. Theory, 2008.
2. J.A. Bondy and U.S.R. Murty, Graph Theory. Springer, 2008.
3. E. Arikan and E. Telatar, "On the rate of channel polarization," July 2008, available from "http://arxiv.org/pdf/0807. 3917".
4. S. B. Korada, E. Şaşoǧlu, and R. Urbanke, "Polar codes: Characterization of exponent, bounds, and constructions," submitted to IEEE Trans. Inform. Theory, 2009.
5. I. Sutskover, S. Shamai, and J. Ziv, "Extremes of information combining," IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1313 - 1325, Apr. 2005.
6. I. Land, S. Huettinger, P. A. Hoeher, and J. B. Huber, "Bounds on information combining," IEEE Transactions on Information Theory, vol. 51, no. 2, pp. 612-619, 2005.