On average throughput and alphabet size in network coding
- Resource Type
- Conference
- Authors
- Chekuri, C.; Fragouli, C.; Soljanin, E.
- Source
- Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Information Theory Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on. :1593-1597 2005
- Subject
- General Topics for Engineers
Communication, Networking and Broadcast Technologies
Signal Processing and Analysis
Throughput
Intelligent networks
Network coding
Routing
Communication networks
Computer networks
Information retrieval
Linear programming
Robustness
- Language
- ISSN
- 2157-8095
2157-8117
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 radicN, 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