Performance and construction of polar codes on symmetric binary-input memoryless channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1496-1500

  Mari, Ryuhei ^a   Tanaka, Toshiyuki ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK ERROR PROBABILITY; CONSTRUCTION COMPLEXITY; DISCRETE MEMORYLESS CHANNELS; LINEAR COMPLEXITY; LOWER BOUNDS; MEMORYLESS CHANNELS; NEW CONSTRUCTION; POLAR CODES; UPPER BOUND;

CONTROL THEORY; PROBABILITY;

INFORMATION THEORY;

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

References (7)

1. E. Ankan, "Channel polarization: A method for construct ing capacityachieving codes for symmetric binary-input memory less channels ," 2008. [Online]. Available: http://arxiv.org/abs/0807.3917
2. E. Ankan and E. Telatar, "On the rate of channel polarization," 2008. [Online]. Available: http://arxiv.org/abs/0807.3806
3. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, 2008.
4. M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan, "Time bounds for select ion," Journal of Computer and System Sciences, vol. 7, pp. 448--461, 1973.
5. A. Caprara , "Constrained 0-1 quadratic programming: Basic approaches and extensions ," European Journal of Operational Research, vol. 187, no. 3, pp. 1494-1503, 2008.
6. C. Chow and C. Liu, "Approximating discrete probabil ity distributions with dependence trees," IEEE Trans. In! Theory, vol. 14, no. 3, pp. 462467, 1968.
7. S. Korada, E. Sasoglu , and R. Urbanke, "Polar codes: characterization of exponent, bounds , and constructions," 2009. [Online]. Available: http://arxiv.org/abs/0901.0536