On the Rate of Channel Polarization

2008/07/24 by Erdal Arikan, Arikan, Erdal, Emre Telatar +1 · 2 citations
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0807.3806

Some minor corrections

arxiv created 2009/04/06 · arxiv updated 2009/12/01

Abstract

It is shown that for any binary-input discrete memoryless channel W with symmetric capacity I(W) and any rate R <I(W), the probability of block decoding error for polar coding under successive cancellation decoding satisfies P_e ≤ 2^-Nβ for any β<\frac12 when the block-length N is large enough.

Cited by

• Pixel-Sensitive and Robust Steganography Based on Polar Codes
• Polarization Decomposition and Its Applications

Related

• A note on some inequalities used in channel polarization and polar coding
• Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels
• Channel Polarization under Channel Noise with Memory
• Polarization for arbitrary discrete memoryless channels
• Polarization as a novel architecture to boost the classical mismatched capacity of B-DMCs