All the codeword symbols in polar codes have the same SER under the SC decoder

Abstract

We consider polar codes constructed from the 2× 2 kernel bmatrix 1 & 0 \\ α & 1 bmatrix over a finite field Fq, where q=ps is a power of a prime number p, and α satisfies that Fp(α) = Fq. We prove that for any Fq-symmetric memoryless channel, any code length, and any code dimension, all the codeword symbols in such polar codes have the same symbol error rate (SER) under the successive cancellation (SC) decoder.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…