TY - GEN
T1 - On average throughput and alphabet size in network coding
AU - Chekuri, Chandra
AU - Fragouli, Christina
AU - Soljanin, Emina
PY - 2005
Y1 - 2005
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
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -