Abstract
In this work, we study the Yeung network coding entropic function outer bound and prove an equivalence relationship between its tightness and the edge removal problem. In addition, we derive an implicit characterization of the 0-error capacity region using restricted sets of entropic vectors.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1769-1773 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781509018062 |
| DOIs | |
| State | Published - 10 Aug 2016 |
| Externally published | Yes |
| Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| Volume | 2016-August |
| ISSN (Electronic) | 2157-8117 |
Conference
| Conference | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
|---|---|
| Country/Territory | Spain |
| City | Barcelona |
| Period | 10/07/16 → 15/07/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Fingerprint
Dive into the research topics of 'On tightness of an entropic region outer bound for network coding and the edge removal property'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver