Fetching the paper…

Reading the bibliography…

2009

The Compound Capacity of Polar Codes

Hassani, S. Hamed, Korada, Satish Babu, Urbanke, Ruediger

Original
PDF
Post on X

Understand

We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels.

By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.

The Compound Capacity of Polar Codes · Around

Built on

D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacity of a class of channels,” The Annals of Mathematical Statistics , vol. 3, no. 4, pp. 1229–1241, 1959
1959
Earlier work this paper cites.
E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” submitted to IEEE Trans. Inform. Theory , 2008
2008
Earlier work this paper cites.

Similar

T. Richardson and R. Urbanke, Modern Coding Theory . Cambridge University Press, 2008
2008
Cited alongside, same era.
S. B. Korada and R. Urbanke, “Polar codes are optimal for lossy source coding,” submitted to IEEE Trans. Inform. Theory , 2009
2009
Cited alongside, same era.

Then

R. Mori and T. Tanaka, “Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels,” Jan. 2009, available from http://arxiv.org/pdf/0901.2207
Original
2009
Closest in time.
S. B. Korada, E. Şaşoğlu, and R. Urbanke, “Polar codes: Characterization of exponent, bounds, and constructions,” submitted to IEEE Trans. Inform. Theory , 2009
Original
2009
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…