Computer Science – Information Theory
Scientific paper
2009-07-19
Computer Science
Information Theory
5 pages
Scientific paper
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.
Hassani Steven H.
Korada Satish Babu
Urbanke Ruediger
No associations
LandOfFree
The Compound Capacity of Polar Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Compound Capacity of Polar Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Compound Capacity of Polar Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-585935