How to Construct Polar Codes

A. Goli, S.H. Hassani, and R. Urbanke, “Universal bounds on the scaling behavior of polar codes,” in Proc. IEEE Symp. Inform. Theory , Cambridge, Massachusetts, 2012, pp. 1957–1961

1961

Earlier work this paper cites.

R.G. Gallager, Information Theory and Reliable Communications . New York: John Wiley, 1968

1968

Earlier work this paper cites.

T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms , 2nd ed. Cambridge, Massachusetts: The MIT Press, 2001

2001

Earlier work this paper cites.

T.M. Cover and J.A. Thomas, Elements of Information Theory , 2nd ed. New York: John Wiley, 2006

2006

Earlier work this paper cites.

T. Richardson and R. Urbanke, Modern Coding Theory . Cambridge, UK: Cambridge University Press, 2008

2008

Earlier work this paper cites.

E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inform. Theory , vol. 55, pp. 3051–3073, 2009

2009

Earlier work this paper cites.

E. Arıkan and E. Telatar, “On the rate of channel polarization,” in Proc. IEEE Symp. Inform. Theory , Seoul, South Korea, 2009, pp. 1493–1495

2009

Earlier work this paper cites.

S.B. Korada, “Polar codes for channel and source coding,” Ph.D. dissertation, Ecole Polytechnique Fédérale de Lausanne, 2009

2009

Earlier work this paper cites.

R. Mori and T. Tanaka, “Performance and construction of polar codes on symmetric binary-input memoryless channels,” in Proc. IEEE Symp. Inform. Theory , Seoul, South Korea, 2009, pp. 1496–1500

2009

Cited alongside, same era.

E. Şaşoğlu, E. Telatar, and E. Arıkan, “Polarization for arbitrary discrete memoryless channels,” arXiv:0908.0302v1 , 2009

Original

2009

Cited alongside, same era.

E. Abbe and E. Telatar, “Polar codes for the m m -user MAC and matroids,” arXiv:1002.0777v2 , 2010

Original

2010

Cited alongside, same era.

E. Arıkan, “Source polarization,” arXiv:1001.3087v2 , 2010

Original

2010

Cited alongside, same era.

S.B. Korada, E. Şaşoğlu, and R. Urbanke, “Polar codes: Characterization of exponent, bounds, and constructions,” IEEE Trans. Inform. Theory , vol. 56, pp. 6253–6264, 2010

S.H. Hassani, R. Mori, T. Tanaka, and R. Urbanke, “Rate-dependent analysis of the asymptotic behavior of channel polarization,” arXiv:1110. 0194v2 , 2011

2011

Closest in time.

B.M. Kurkoski and H. Yagi, “Quantization of binary-input discrete memoryless channels with applications to LDPC decoding,” arXiv:11107. 5637v1 , 2011

2011

Closest in time.

H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,” IEEE Trans. Inform. Theory , vol. 57, pp. 6428–6443, 2011

2011

Closest in time.

R. Pedarsani, S.H. Hassani, I. Tal, and E. Telatar, “On the construction of polar codes,” in Proc. IEEE Symp. Inform. Theory , Saint Petersburg, Russia, 2011, pp. 11–15

2011

Closest in time.

E. Şaşoğlu, “Polarization in the presence of memory,” in Proc. IEEE Symp. Inform. Theory , Saint Petersburg, Russia, 2011, pp. 189–193