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.
Details
Title
The compound capacity of polar codes
Author(s)
Hassani, S. Hamed ; Korada, Satish Babu ; Urbanke, Rudiger
Published in
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Pages
16-21
Conference
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 30 09 - 2 October 2009
Date
2009
Publisher
IEEE
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
LTHC
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LTHC - Communication Theories Laboratory
Conference Papers
Work produced at EPFL
Published
Conference Papers
Work produced at EPFL
Published
Record creation date
2010-05-10