Abstract
We consider a delay-constrained streaming model for zero-error communications and show that under this model, network coding and index coding problems are code equivalent. That is, any streaming network coding instance can be efficiently mapped to a corresponding acyclic streaming index coding instance such that an index code for the latter can be efficiently transformed into a network code for the former. This reduction holds even for network coding instances that contain cycles, thereby proving the first known reduction from cyclic to finite acyclic network coding networks.
Original language | English |
---|---|
Title of host publication | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1638-1642 |
Number of pages | 5 |
ISBN (Electronic) | 9781509040964 |
DOIs | |
State | Published - 9 Aug 2017 |
Externally published | Yes |
Event | 2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
ISSN (Print) | 2157-8095 |
Conference
Conference | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
---|---|
Country/Territory | Germany |
City | Aachen |
Period | 25/06/17 → 30/06/17 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.