A necessary and sufficient condition for solvability of a 3s/3t sum-network

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1858-1862

  Shenvi, Sagar ^a   Dey, Bikash Kumar ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; ARBITRARY NUMBER; LINEAR CODES; SUFFICIENT CONDITIONS;

INFORMATION THEORY;

MATHEMATICAL TECHNIQUES;

EID: 77955703487     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513430     Document Type: Conference Paper

References (19)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, 2003.
3. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-795, 2003.
4. A. Ramamoorthy, "Communicating the sum of sources over a network," in Proc. ISIT, (Toronto, Canada), pp. 1646-1650, 2008.
5. B. K. Rai, B. K. Dey, and A. Karandikar, "Some results on communicating the sum of sources over a network," in Proc. NetCod, 2009.
6. B. K. Rai and B. K. Dey, "Feasible alphabets for communicating the sum of sources over a network," in Proc. ISIT, (Seoul, Korea), 2009.
7. M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," in Proc. ISIT, (Seoul, Korea), 2009.
8. B. K. Rai, B. K. Dey, and S. Shenvi, "Some bounds on the capacity of communicating the sum of sources," in Proc. ITW, 2010.
9. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network computing capacity for the reverse butterfly network," in Proc. ISIT, (Seoul, Korea), 2009.
10. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing," in Proceedings of Annual Allerton Conference, (UIUC, IIlinois, USA), 2008.
11. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing part i: Cut-set bounds," available at http://arxiv.org/abs/0912.2820.
12. J. Korner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inform. Theory, vol. 25, no. 2, pp. 219-221, 1979.
13. D. Krithivasan and S. S. Pradhan, "An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources," in Proc. ISIT, (Toronto, Canada), pp. 56-60, 2008.
14. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inform. Theory, vol. 34, pp. 176-180, 1988.
15. B. K. Rai and B. K. Dey, "Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachiev-ability of coding capacity," available at http://arxiv.org/abs/ 0906.0695.
16. R. Koetter, M. Effros, T. Ho, and M. Médard, "Network codes as codes on graphs," in Proc. CISS, 2004.
17. T. Ho and D. Lun, Network Coding: An Introduction. Cambridge, U.K.: Cambridge University Press, 2008.
18. S. Shenvi and B. K. Dey, "A simple necessary and sufficient condition for the double unicast problem," in Proc. ICC, (Cape Town, South Africa), May 2010.
19. S. Shenvi and B. K. Dey, "On the solvability of 3-source 3-terminal sum-networks," available at http://arxiv.org/abs/1001.4137.