Computer Science – Information Theory
Scientific paper
2010-02-17
Computer Science
Information Theory
Submitted to ISIT 2010
Scientific paper
We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes and transmission over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bhattacharyya constant falls in a fixed interval $[a,b]$. Mathematically this can be stated as bounding the limit $\lim_{n \to \infty} \frac{1}{n} \ln \mathbb{P}(Z_n \in [a,b])$, where $Z_n$ is the Bhattacharyya process. The quantity $\mathbb{P}(Z_n \in [a,b])$ represents the fraction of sub-channels that are still un-polarized at time $n$.
Alishahi Kasra
Hassani Steven H.
Urbanke Rudiger
No associations
LandOfFree
On the scaling of Polar Codes: II. The behavior of un-polarized channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the scaling of Polar Codes: II. The behavior of un-polarized channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the scaling of Polar Codes: II. The behavior of un-polarized channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-51421