Facts of LIFE

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn , Issue , 2007, Pages 832-837

  Barbero, Ángela I ^a   Ytrehus, Øyvind ^b  

^a UNIVERSITY OF VALLADOLID   (Spain)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Encoding complexity; Field size; Multicasting; Network codes

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; LINEAR EQUATIONS; MULTICASTING;

ENCODING COMPLEXITY; NETWORK CODES;

ALGORITHMS;

EID: 40949131085     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2007.4317921     Document Type: Conference Paper

References (14)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network Information Flow", IEEE Transactions on Information Theory, Vol. 46, April 2000, pp. 1204-1216.
2. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithms for Network Information Flow", Proc. SPAA'03, San Diego, June 7-9, 2003, pp. 286-294.
3. S. Jaggi, P. Sanders, P.A. Chou, M. Effros, S. Egner, K. Jain and L.M.G.M. Tolhuizen, "Polynomial Time Algorithms for Multicast Network Code Construction", IEEE Transactions on Information Theory, Vol. 51, June 2005, pp. 1973-1982.
4. Á. Barbero and O. Ytrehus, "Cycle-logical Treatment of 'Cyclopathic' Networks", IEEE Transactions on Information Theory, Vol. 52, June 2006, pp. 2795-2805.
5. Á. Barbero and O. Ytrehus, "Knotworking", Proceedings of ITA 2006, San Diego, February 2006 (electronic publication).
6. E. Erez and M.Feder, "Convolutional network coding", Proceedings of ISIT'04 Chicago, June 2004,p. 146.
7. M. Langberg, A. Sprintson, and J. Bruck, "The Encoding Complexity of Network Coding", IEEE Transactions on Information Theory, Vol. 52, June 2006, pp. 2386-2397.
8. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding", IEEE Transactions on Information Theory, Vol. 52, March 2006, pp. 829-848.
9. C. Chekuri, C. Fragouli and E. Soljanin, "On Average Throughput and Alphabet Size in Network Coding", IEEE Transactions on Information Theory, Vol. 52, June 2006, pp. 2410-2424.
10. Á. Barbero and O. Ytrehus, "Heuristic Algorithms for Small Field Multicast Encoding", Proceedings of ITW'06 Chengdu, October 2006,pp. 428-432.
11. S.-Y. R. Li, R. W. Yeung and N. Cai, "Linear Network Coding", IEEE Transactions on Information Theory, Vol. 46, April 2000, pp. 1204-1216.
12. L. R. Ford, D. R. Fulkerson, "Maximal Flow through a Network", Canadian Journal of Mathematics, 8 (1956), pp.399-404.
13. P. Elias, A. Feinstein, and C. E. Shannon, "Note on maximum, flow through a network", IRE Transactions on Information Theory, IT-2, pp. 117-199, 1956.
14. Á. Barbero and O. Ytrehus, "An efficient centralized binary multicast network coding algorithm for any cyclic network", Submitted.