2000 character limit reached
Universal Polar Decoding with Channel Knowledge at the Encoder (1311.7590v1)
Published 29 Nov 2013 in cs.IT and math.IT
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.