Polar codes: Characterization of exponent, bounds, and constructions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1483-1487

  Korada, Satish Babu ^a   Şaşǒglu, Eren ^a   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODE; DECODING STRATEGY; DISCRETE MEMORYLESS CHANNELS; ERROR EXPONENT; ERROR PROBABILITIES; LOW COMPLEXITY; MATRIX; MATRIX SIZE; POLAR CODES; RECURSIVE CONSTRUCTION; REED-MULLER CODES; SQUARE MATRICES; SQUARE ROOTS; SUCCESSIVE CANCELLATION; SYMMETRIC CAPACITY; UPPER AND LOWER BOUNDS;

COMMUNICATION CHANNELS (INFORMATION THEORY); CONTROL THEORY; RECURSIVE FUNCTIONS;

PROBABILITY;

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

References (5)

1. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," submitted to IEEE Trans. Inform. Theory, 2008.
2. E. Arikan and E. Telatar, "On the rate of channel polarization," July 2008, available from "http://arxiv.org/pdf/0807. 3917".
3. S. B. Korada, E. Şaşǒglu, and R. Urbanke, "Polar codes: Characterization of exponent, bounds, and constructions," submitted to IEEE Trans. Inform. Theory, 2009.
4. S. B. Korada and E. Şaşǒglu, "A class of transformations that polarize symmetric binary-input memoryless channels," submitted to ISIT, 2009.
5. R. E. Blahut, Theory and Practice of Error Control Codes. Addison-Wesley, 1983.