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 Citations (Scopus)

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
StatePublished - Dec 1 2005
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

Network coding
Network Coding
Throughput
Coding
Configuration
Receiver
Binary
Demonstrate
Class

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
Chekuri, Chandra ; Fragouli, Christina ; Soljanin, Emina. / On average throughput and alphabet size in network coding. Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. 2005. pp. 1593-1597 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{acb8c3921f3d4c3ca1fc1d5f90faa176,
title = "On average throughput and alphabet size in network coding",
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.",
author = "Chandra Chekuri and Christina Fragouli and Emina Soljanin",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISIT.2005.1523613",
language = "English (US)",
isbn = "0780391519",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "1593--1597",
booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05",

}

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., 1523613, IEEE International Symposium on Information Theory - Proceedings, vol. 2005, pp. 1593-1597, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 9/4/05. https://doi.org/10.1109/ISIT.2005.1523613

On average throughput and alphabet size in network coding. / Chekuri, Chandra; Fragouli, Christina; Soljanin, Emina.

Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. 2005. p. 1593-1597 1523613 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2005).

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

TY - GEN

T1 - On average throughput and alphabet size in network coding

AU - Chekuri, Chandra

AU - Fragouli, Christina

AU - Soljanin, Emina

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745175579&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745175579&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523613

DO - 10.1109/ISIT.2005.1523613

M3 - Conference contribution

AN - SCOPUS:33745175579

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1593

EP - 1597

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05

ER -

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