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
Main Authors: Hassani, S.H., Korada, S.B., Urbanke, R.
Format: Conference Proceeding
Language:English
Subjects:
Channel capacity
Channel coding
Code standards
Decoding
Distributed computing
Error probability
History
Mutual information
Source coding
Transmitters
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
DOI:10.1109/ALLERTON.2009.5394827