The Compound Capacity of Polar Codes
classification
💻 cs.IT
math.IT
keywords
capacitycompoundcodesdecodingpolarsuccessiveunderbinary-input
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.