pith. sign in

arxiv: 0807.3806 · v3 · submitted 2008-07-24 · 💻 cs.IT · math.IT

On the Rate of Channel Polarization

classification 💻 cs.IT math.IT
keywords betachanneldecodingratebinary-inputblockblock-lengthcancellation
0
0 comments X
read the original 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 \le 2^{-N^\beta}$ for any $\beta<\frac12$ when the block-length $N$ is large enough.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.