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...

Full description

Saved in:
Bibliographic Details
Published in2009 47th Annual Allerton Conference on Communication, Control, and Computing pp. 16 - 21
Main Authors Hassani, S.H., Korada, S.B., Urbanke, R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2009
Subjects
Channel capacity
Channel coding
Code standards
Decoding
Distributed computing
Error probability
History
Mutual information
Source coding
Transmitters
Online AccessGet full text
ISBN9781424458707
1424458706
DOI10.1109/ALLERTON.2009.5394827

Cover

More Information
Summary: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.
ISBN:9781424458707
1424458706
DOI:10.1109/ALLERTON.2009.5394827