Published June 2017
| public
Book Section - Chapter
A code equivalence between streaming network coding and streaming index coding
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.
Additional Information
© 2017 IEEE. This material is based upon work supported by the National Science Foundation under Grant No. CCF-1527524 and No. CCF-1526771. M. F. Wong would like to thank Parham Noorzad for helpful discussions.Additional details
- Eprint ID
- 80509
- Resolver ID
- CaltechAUTHORS:20170816-151411717
- CCF-1527524
- NSF
- CCF-1526771
- NSF
- Created
-
2017-08-16Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field