Polar Codes for q-Ary Channels, q=2r

IEEE Transactions on Information Theory

Volumn 59, Issue 2, 2013, Pages 955-969

  Park, Woomyoung ^a   Barg, Alexander ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Bhattacharyya distance; multilevel polarization; nonbinary codes; ordered weight

Indexed keywords

BHATTACHARYYA DISTANCE; BLOCK ERROR PROBABILITY; CODE LENGTH; DISCRETE MEMORYLESS CHANNELS; NON-BINARY; NON-BINARY CODES; ORDERED WEIGHT; POLAR CODES; RELIABLE TRANSMISSION; SUCCESSIVE CANCELLATION; SYMMETRIC CAPACITY; TRANSMISSION SCHEMES; VIRTUAL CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY); POLARIZATION;

TRANSMISSIONS;

EID: 84872557415     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2219035     Document Type: Article

References (17)

1. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
2. S. B. Korada, E. Şaşoǧlu, and R. Urbanke, "Polar codes: Characterization of exponent, bounds, and constructions," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6253-6264, Dec. 2010.
3. E. Şaşoǧlu, E. Telatar, and E.Arikan, Polarization for arbitrary discrete memoryless Channels 2009 [Online]. Available: arXiv:0908.0302
4. E. Şaşoǧlu, "Polar codes for discrete alphabets," in Proc. IEEE Int. Symp. Inf. Theory, Boston, MA, Jul. 1-5, 2012, pp. 2147-2151.
5. R. Mori and T. Tanaka, "Channel polarization on -ary discrete memoryless channels by arbitrary kernels," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 13-18, 2010, pp. 894-898.
6. E.Abbe and E. Telatar, Polar codes for the -userMAC 2010 [Online]. Available: arXiv:1002.0777
7. E. Abbe, Mutual information, matroids and extremal dependencies 2010 [Online]. Available: arXiv:1012.4755
8. W. Park and A. Barg, "The ordered Hamming metric and ordered symmetric channels," in Proc. IEEE Int. Symp. Inf. Theory, St.Petersburg, Russia, Aug. 1-5, 2011, pp. 2194-2198.
9. R. A. Brualdi, J. Graves, and K. M. Lawrence, "Codes with a poset metric," Discrete Math., vol. 147, no. 1-3, pp. 57-72, 1995.
10. H. Niederreiter, "A combinatorial problem for vector spaces over finite fields," Discrete Math., vol. 96, no. 3, pp. 221-228, 1991.
11. A. Barg and P. Purkayastha, "Bounds on ordered codes and orthogonal arrays," Moscow Math. J., vol. 9, pp. 211-243, Jul. 2009.
12. A. G. Sahebi and S. S. Pradhan, Multilevel polarization of polar codes over arbitrary discrete memoryless channels 2011 [Online]. Available: arXiv:1107.1535
13. L. B. Koralov and Y. G. Sinai, Theory of Probability and Random Processes, 2nd ed. Berlin, Germany: Springer-Verlag, 2007.
14. P. Diaconis and D. Freedman, "Iterated random functions," SIAMRev., vol. 41, no. 1, pp. 45-76, 1999. (Pubitemid 129723747)
15. W. Park and A. Barg, "Multilevel polarization for nonbinary codes and parallel channels," in Proc. 49th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, Sep. 28-30, 2011, pp. 228-234.
16. E. Arikan and E. Telatar, "On the rate of channel polarization," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun.-Jul. 28-3, 2009, pp. 1493-1495.
17. S. Tavildar and P. Viswanath, "Approximately universal codes over slow-fading channels," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3233-3258, Jul. 2006. (Pubitemid 44192978)