Universal Polar Decoding with Channel Knowledge at the Encoder
classification
💻 cs.IT
math.IT
keywords
polarchannelchannelsencoderknowledgeachievebinarycapacity
read the original abstract
Polar coding over a class of binary discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the capacity of convex and one-sided classes of symmetric channels.
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.