Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.14184 v3 pith:YQG3JE7M submitted 2022-03-27 cs.IT math.IT

classification cs.ITmath.IT
keywords mathbbalphacodespolarbmatrixcodecodeworddecoder
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider polar codes constructed from the $2\times 2$ kernel $\begin{bmatrix} 1 & 0 \\ \alpha & 1 \end{bmatrix}$ over a finite field $\mathbb{F}_{q}$, where $q=p^s$ is a power of a prime number $p$, and $\alpha$ satisfies that $\mathbb{F}_{p}(\alpha) = \mathbb{F}_{q}$. We prove that for any $\mathbb{F}_{q}$-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.

Discussion (0). Sign in to comment.

Pith tools