On the capacity of noncoherent network coding

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1046-1066

  Siavoshani, Mahdi Jafari ^a   Mohajer, Soheil ^a,b   Fragouli, Christina ^a   Diggavi, Suhas N ^a,c  

^a EPFL   (Switzerland)

^b Princeton University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Channel capacity; multisource multicast; network coding; noncoherent communication; randomized network coding; subspace coding

Indexed keywords

CHANNEL MODEL; CODING VECTORS; INTERMEDIATE NETWORKS; LINEAR NETWORK CODING; MULTI-SOURCE MULTICAST; MULTICASTS; MULTIPLE ACCESS CHANNELS; MULTIPLE SOURCE; NETWORK CODING; NETWORK OPERATIONS; NETWORK PARAMETERS; NON-COHERENT; NONCOHERENT COMMUNICATION; PACKET LENGTH; SUBSPACE CODING;

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); MULTICASTING;

VECTORS;

EID: 79251516713     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2094813     Document Type: Article

References (27)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, Jul. 2000.
2. S.-Y. R. Li, N. Cai, and R. W. Yeung, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, pp. 371-381, Feb. 2003.
3. R.Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw. , vol. 11, no. 5, pp. 782-795, Oct. 2003.
4. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, pp. 829-848, Mar. 2006.
5. T. Ho, R. Koetter, M. Medard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
6. R. Koetter and F. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, Aug. 2008.
7. D. Silva, F. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, pp. 3951-3967, Sep. 2008.
8. M. J. Siavoshani, C. Fragouli, and S. Diggavi, "Passive topology discovery for network coded systems," in Proc. Inf. Theory Workshop, Bergen, Norway, Jul. 2007.
9. M. J. Siavoshani, C. Fragouli, and S. Diggavi, "Non-coherent multisource network coding," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, Canada, Jul. 2008, pp. 817-821.
10. M. J. Siavoshani, S. Mohajer, C. Fragouli, and S. Diggavi, "On the capacity of non-coherent network coding," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 2009, pp. 273-277.
11. K. Price and R. Storn, "Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces," J. Global Optimiz., vol. 11, pp. 341-359, 1997.
12. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Commun., Contr, Comput., IL, Oct. 2003.
13. L. Keller, M. J. Siavoshani, C. Fragouli, K. Argyraki, and S. Diggavi, "Joint identity-message coding for sensor networks," IEEE J. Sel. Areas Commun., vol. 28, pp. 1083-1093, Sep. 2010.
14. A. Montanari and R. Urbanke, Coding for Network Coding 2007 [Online]. Available: http://arxiv.org/abs/0711.3935/
15. T. Cover and J. Thomas, Elements of Information Theory, Second ed. New York: Wiley , 2006.
16. D. Silva, F. R. Kschischang, and R. Koetter, "Communication over finite-field matrix channels," IEEE Trans. Inf. Theory, vol. 56, pp. 1296-1305, Mar. 2010.
17. S. Mohajer, M. J. Siavoshani, S. N. Diggavi, and C. Fragouli, "On the capacity of multisource non-coherent network coding," in Proc. Inf. Theory Workshop, Jun. 2009, pp. 130-134.
18. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
19. L. Zheng and D. N. C. Tse, "Communication on the Grassmannian manifold: A geometric approach to the non-coherent multiple-antenna channel," IEEE Trans. Inf. Theory, vol. 48, pp. 359-383, Feb. 2002.
20. P. Sattari, A. Markopoulou, and C. Fragouli, "Multiple source multiple destination topology inference using network coding," in Proc. Workshop on Netw. Coding, Theory Appl., Lausanne, Switzerland, Jun. 2009.
21. G. Sharma, S. Jaggi, and B. K. Dey, "Network tomography via network coding," in Proc. Inf. Theory Appl. Workshop, 2007.
22. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Second ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
23. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," IEEE Trans. Inf. Theory, vol. 54, pp. 3202-3206, Jul. 2008.
24. M. Gadouleau and Z. Yan, "Packing and covering properties of subspace codes for error control in random linear network coding," IEEE Trans. Inf. Theory, vol. 56, pp. 2097-2108, May 2010.
25. G. Andrews, "The theory of partitions," in Encyclopedia of Mathematics and its Applications. Cambridge, U.K.: Cambridge Univ. Press, 1976.
26. E. Gabidulin, "Theory of codes with maximum rank distance," Problems of Inf. Transmiss., vol. 21, no. 1, pp. 1-12, Jan. 1985.
27. Tinyos [Online]. Available: *http://www.tinyos.net/