Fetching the paper…
Reading the bibliography…
Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes.
A. R. Calderbank and P. W. Shor, Physical Review A 54
1996
Earlier work this paper cites.
A. Steane, Proceedings of the Royal Society A 452
1996
Earlier work this paper cites.
C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, Physical Review Letters 78
1997
Earlier work this paper cites.
P. W. Shor and J. Preskill, Physical Review Letters 85
2000
Earlier work this paper cites.
J. M. Renes and J. Boileau, Physical Review A 78
2008
Earlier work this paper cites.
E. Arikan and E. Telatar, arXiv:quant-ph/0807.3806 (2008)
2008
Cited alongside, same era.
E. Arikan, IEEE Transactions on Information Theory 55
2009
Cited alongside, same era.
E. Sasoglu, E. Telatar, and E. Arikan, in IEEE Information Theory Workshop, 2009. (IEEE, 2009) pp. 144–148
2009
Cited alongside, same era.
R. Mori and T. Tanaka, in IEEE International Symposium on Information Theory, 2009. (IEEE, 2009) pp. 1496–1500
2009
Cited alongside, same era.
N. Hussami, R. Urbanke, and S. B. Korada, in IEEE International Symposium on Information Theory, 2009. (IEEE, 2009) pp. 1488–1492
2009
Cited alongside, same era.
M. M. Wilde and S. Guha, arXiv:1109.2591 (2011a)
Cited in the paper.
M. M. Wilde and S. Guha, arXiv:1109.5346 (2011b)
Cited in the paper.
Which values the inputs should take must also be determined. For a symmetric channel such as the BSC, all choices are equivalent, but for general channels they are not. In practice one could choose the inputs at random and be assured that the coding scheme will work with high probability
Cited in the paper.
S. B. Korada, Polar codes for channel and source coding , Ph.D. thesis , EPFL, Lausanne, Switzerland (2009)
2009
Later among the works it cites.
E. Arikan and E. Telatar, in IEEE International Symposium on Information Theory, 2009. (IEEE, 2009) pp. 1493–1495
2009
Later among the works it cites.
S. B. Korada, E. Şaşoğlu, and R. Urbanke, IEEE Transactions on Information Theory 56
2010
Later among the works it cites.
H. Mahdavifar and A. Vardy, IEEE Transactions on Information Theory 57
2011
Closest in time.
M. M. Wilde and J. M. Renes, arXiv:1201.2906 [quant-ph] (2012)
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…