Universal polar decoding with channel knowledge at the encoder

Polar coding over a class of binary input discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the symmetric capacity of convex and one-sided sets of channels. This result makes the polar decoder the first low complexity O(N logN) decoder proved to be universal over one sided sets of symmetric channels.