Network coding gain of combination networks

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 283-287

  Ngai, Chi Kin ^a   Yeung, Raymond W ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAYS; GAIN CONTROL; MULTICASTING; SET THEORY; SIGNAL ENCODING; THEOREM PROVING;

MULTICAST RATE; NETWORK CODING; NODES; RECOMBINATION NETWORKS;

NETWORKS (CIRCUITS);

EID: 19544363195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network Information Flow," IEEE Trans. Inform. Theory, IT-46: 1204 -1216, 2000.
2. S.-Y. R. Li, R. W. Yeung and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, IT-49: 371-381, 2003.
3. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Transactions on network coding, vol. 11, 782-795, 2003.
4. P. Sanders, S. Egner and L. Tolhuizen, "Polynomial Time Algorithms for Network Information Flow," 15th ACM Symposium on Parallelism in Algorithms and Architectures, Jun. 2003.
5. Z. P. Li, B. C. Li, D. Jiang and L. C. Lau, "On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies, " Theoretical and Empirical Studies," ECE Technical Report, University of Toronto, May 2004.