An entropy inequality for q-ary random variables and its application to channel polarization

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-) <= I(W) <= 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.


Published in:
2010 Ieee International Symposium On Information Theory, 1360-1363
Presented at:
2010 IEEE International Symposium on Information Theory, Austin, TX, Jul 13, 2010
Year:
2010
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-6960-4
Keywords:
Laboratories:




 Record created 2011-12-16, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)