On average throughput and alphabet size in network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1593-1597

  Chekuri, Chandra ^a   Fragouli, Christina ^b   Soljanin, Emina ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; CODE DESIGN; NETWORK CODING; RANDOMIZED CODING;

INFORMATION TECHNOLOGY; INFORMATION THEORY; SIGNAL RECEIVERS; TELECOMMUNICATION NETWORKS;

BINARY CODES;

EID: 33745175579     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523613     Document Type: Conference Paper

References (9)

1. R. Ahlswede, N. Cai, S-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transac. Inform. Theory, pages 1204-1216, July 2000.
2. S-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transac. Inform. Theory, 49:371-381, February 2003.
3. P. Sanders, S. Egner. and L. Tolhuizen. Polynomial time algorithms for network information flow. Proc. 15th ACM Symposium on Parallel. Algorithms and Architectures, 2003.
4. A. Agarwal and M. Charikar. On the advantage of network coding for improving network throughput. In Proc. of 2004 IEEE Information Theory Workshop, San Antonio, Texas, Oct. 2004.
5. L. Zosin and S. Khuller. On directed steiner trees. In Proc. 13th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA '02), pages 59-63, 2002.
6. E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang. Integrality ratio for group steiner trees and directed steiner trees. In Proc. of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003.
7. C. Fragouli and E. Soljanin. On average throughput benefits for network coding. Proc. 42nd Annual Allerton Conference, Monticello, IL, Oct. 2004.
8. C. Chekuri, C. Fragouli, and E. Soljanin. On average throughput and alphabet size in network coding. Submitted to the joint special issue of the IEEE Trans. on Information Theory and the IEEE/ACM Trans. on Networking.
9. T. Ho, M. Mèdard, J. Shi, M. Effros, and D. R. Karger. On randomized network coding. Proc. 41st Annual Allerton Conference, Monticello, IL, Oct. 2003.