On average throughput and alphabet size in network coding

Chandra Chekuri, Christina Fragouli, Emina Soljanin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to √N, with respect to the average as well as the minimum throughput. For this class of configurations we also show that there exists a deterministic coding scheme that realizes these benefits using a binary alphabet whereas randomized coding may require an exponentially large alphabet size.

Original languageEnglish (US)
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages1593-1597
Number of pages5
DOIs
Publication statusPublished - Dec 1 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

Publication series

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

Other

Other2005 IEEE International Symposium on Information Theory, ISIT 05
CountryAustralia
CityAdelaide
Period9/4/059/9/05

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Chekuri, C., Fragouli, C., & Soljanin, E. (2005). On average throughput and alphabet size in network coding. In Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05 (pp. 1593-1597). [1523613] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2005). https://doi.org/10.1109/ISIT.2005.1523613