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

Eren Sasoglu

doi:10.1109/ISIT.2010.5513502

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

Information Theory 2016-11-18 v1 math.IT

Authors: Eren Sasoglu

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

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.

Keywords

entropy inequality q-ary random variables channel polarization symmetric capacity prime alphabet polar code

Cite

@article{arxiv.1006.2006,
  title  = {An entropy inequality for q-ary random variables and its application to channel polarization},
  author = {Eren Sasoglu},
  journal= {arXiv preprint arXiv:1006.2006},
  year   = {2016}
}

Comments

To be presented at the IEEE 2010 International Symposium on Information Theory

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

Abstract

Keywords

Cite

Comments

Related papers