Computer Science – Information Theory
Scientific paper
2010-06-10
Computer Science
Information Theory
To be presented at the IEEE 2010 International Symposium on Information Theory
Scientific paper
It is shown that given two copies of a q-ary input channel $W$, where q is
prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric
capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are
strict except in trivial cases. This leads to a simple proof of channel
polarization in the q-ary case.
No associations
LandOfFree
An entropy inequality for q-ary random variables and its application to channel polarization 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 An entropy inequality for q-ary random variables and its application to channel polarization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An entropy inequality for q-ary random variables and its application to channel polarization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-492154