Computer Science – Information Theory
Scientific paper
2012-01-31
Computer Science
Information Theory
Scientific paper
Consider any discrete memoryless channel (DMC) with arbitrarily but finite input and output alphabets X, Y respectively. Then, for any capacity achieving input distribution all symbols occur less frequently than 1-1/e$. That is, \[ \max\limits_{x \in \mathcal{X}} P^*(x) < 1-\frac{1}{e} \] \noindent where $P^*(x)$ is a capacity achieving input distribution. Also, we provide sufficient conditions for which a discrete distribution can be a capacity achieving input distribution for some DMC channel. Lastly, we show that there is no similar restriction on the capacity achieving output distribution.
Kumar Gowtham
Manolakos Alexandros
No associations
LandOfFree
No input symbol should occur more frequently than 1-1/e 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 No input symbol should occur more frequently than 1-1/e, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No input symbol should occur more frequently than 1-1/e will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-56453