The compound capacity of polar codes

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.


Published in:
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 16-21
Presented at:
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 30 09 - 2 October 2009
Year:
2009
Publisher:
IEEE
Keywords:
Laboratories:




 Record created 2010-05-10, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)