Reduced-complexity network coding for multicasting over ad hoc networks

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn III, Issue , 2005, Pages

  Wu, Yunnan ^a   Kung, Sun Yuan ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMPUTER SIMULATION; MULTICASTING; SIGNAL ENCODING; THROUGHPUT;

AD HOC NETWORKS; CONVENTIONAL ROUTING PARADIGM; MULTIPLE DESTINATION NODES; NETWORK CODING;

DIGITAL COMMUNICATION SYSTEMS;

EID: 33646794635     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2005.1415756     Document Type: Conference Paper

References (6)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Information Theory, vol. IT- 46, no. 4, pp. 1204-1216, July 2000.
2. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," 41st Allerton Conf. Comm., Ctrl. and Computing, Oct. 2003.
3. J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, ed. R. Rustin, Academic Press, NY, 1973.
4. L. Lov́asz, "Connectivity in digraphs," Journal of Combinational Theory B, vol. 15, pp. 174-177, 1973.
5. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of Menger's and Edmonds' graph theorems and Ahlswede et al's network coding theorem," in 42nd Allerton Conf. Comm., Control and Computing, Monticello, IL, Oct. 2004, Invited paper.
6. P. Tong and E. L. Lawler, "A faster algorithm for finding edge-disjoint branchings," Information Processing Letters, 17(2):73-76, Aug. 1983.