An entropy inequality for q-ary random variables and its application to channel polarization
Clicks: 71
ID: 283358
2010
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
21.0
/100
71 views
14 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #370 of 803 articles by views in arXiv
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 803 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
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.
| Reference Key |
sasoglu2010an
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Eren Sasoglu |
| Journal | arXiv |
| Year | 2010 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.