Polar coding for interference networks
Clicks: 65
ID: 283378
2014
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
19.8
/100
65 views
17 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #472 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
A polar coding scheme for interference networks is introduced. The scheme
combines Arikan's monotone chain rules for multiple-access channels and a
method by Hassani and Urbanke to 'align' two incompatible polarization
processes. It achieves the Han--Kobayashi inner bound for two-user interference
channels and generalizes to interference networks.
| Reference Key |
sasoglu2014polar
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Lele Wang; Eren Sasoglu |
| Journal | arXiv |
| Year | 2014 |
| 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.