Skip to main navigation Skip to search Skip to main content

A code equivalence between streaming network coding and streaming index coding

  • California Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1638-1642
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period06/25/1706/30/17

Fingerprint

Dive into the research topics of 'A code equivalence between streaming network coding and streaming index coding'. Together they form a unique fingerprint.

Cite this