The Compound Capacity of Polar Codes
Information Theory
2009-07-21 v1 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.0907.3291,
title = {The Compound Capacity of Polar Codes},
author = {S. Hamed Hassani and Satish Babu Korada and Ruediger Urbanke},
journal= {arXiv preprint arXiv:0907.3291},
year = {2009}
}
Comments
5 pages