On Average Throughput Benefits and Alphabet Size in Network Coding

e 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 \sqrt{N}, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.


Published in:
ISIT 2005, 1593-1597
Presented at:
IEEE International Symposium on Information Theory (ISIT'05), Adelaide, Australia, 4-9 September, 2005
Year:
2005
Laboratories:




 Record created 2006-12-08, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)