pith. sign in

arxiv: cs/0510067 · v1 · submitted 2005-10-23 · 💻 cs.IT · math.IT

On the Spread of Random Interleaver

classification 💻 cs.IT math.IT
keywords spreadblocklengthincreasesinterleaverprobabilityboundconvergesdetermine
0
0 comments X
read the original abstract

For a given blocklength we determine the number of interleavers which have spread equal to two. Using this, we find out the probability that a randomly chosen interleaver has spread two. We show that as blocklength increases, this probability increases but very quickly converges to the value $1-e^{-2} \approx 0.8647$. Subsequently, we determine a lower bound on the probability of an interleaver having spread at least $s$. We show that this lower bound converges to the value $e^{-2(s-2)^{2}}$, as the blocklength increases.

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.