The compound capacity of polar codes

Authors:
S. Hamed Hassani;Satish Babu Korada;Rüdiger Urbanke
Affiliations:
EPFL, School of Computer & Communication Sciences, Lausanne, Switzerland;EPFL, School of Computer & Communication Sciences, Lausanne, Switzerland;EPFL, School of Computer & Communication Sciences, Lausanne, Switzerland
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 4
Cited 0

Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels

IEEE Transactions on Information Theory
Modern Coding Theory

Modern Coding Theory
Polar codes are optimal for lossy source coding

IEEE Transactions on Information Theory
Polar codes: characterization of exponent, bounds, and constructions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-inputmemoryless 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.