Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 598-602

  Gohari, Amin Aminzadeh ^a   Yang, Shenghao ^b   Jaggi, Sidharth ^b  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE; BOUNDING TECHNIQUES; COMMUNICATION PROBLEMS; CORRELATED SOURCES; CUT-SET BOUND; JOINT DISTRIBUTIONS; NETWORK COMMUNICATIONS; PARTIAL KNOWLEDGE;

COMMUNICATION; INFORMATION THEORY; NETWORK ARCHITECTURE; RANDOM VARIABLES;

NETWORK CODING;

EID: 80054809779     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034199     Document Type: Conference Paper

References (17)

1. C. K. Ngai and R. W. Yeung, "Multisource network coding with two sinks", in Proc. Int. Conf. Communications, Circuits and Systems ICCCAS 2004, vol. 1, 2004, pp. 34-37.
2. E. Erez and M. Feder, "Capacity region and network codes for two receivers multicast with private and common data", in in Workshop on Coding, Cryptography and Combinatorics, 2003.
3. P. Gács and J. Körner, "Common information is much less than mutual information", Probl. Contr. Inf. Theory, Vol. 2, pp. 149-162 (1973).
4. Z. Zhang, "On a new non-shannon-type information inequality", Communications in Information and Systems, 3(1):47-60 (2003).
5. R. M. Gray and A. D. Wyner, "Source coding for a simple network", The Bell System Technical Journal, vol. 53, no. 9, pp. 16811721, November 1974.
6. A. D. Wyner, "On source coding with side information at the decoder", IEEE Trans. Inf. Theory, vol. 21, no. 3, pp. 294300, 1975.
7. A. A. Gohari, S. Yang and S. Jaggi, "Beyond the Cut Set Bound: Uncertainty Computations in Network Coding with Correlated Sources", Available on arxiv.
8. T. Ho, M. Medard, M. Effros and R. Koetter, "Network Coding for Correlated Sources", Invited Paper, Conference on Information Sciences and Systems (CISS), 2004.
9. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, "Separating Distributed Source Coding from Network Coding", IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2785-2795, 2006.
10. J. Barros, S. D. Servetto, "Network information flow with correlated sources", IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 155-170, 2006.
11. M. Effros, M. Médard, T. Ho, S. Ray, D. Karger, and R. Koetter, "Linear network codes: A unified framework for source, channel and network coding", in Proc. DIMACS Workshop Networking Information Theory, Piscataway, NJ, 2003.
12. T. P. Coleman, E. Martinian, and E. Ordentlich, "Joint source-channel coding for transmitting correlated sources over broadcast networks", IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 38643868, 2009.
13. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman. "On the capacity of information networks", IEEE Trans. Inf. Theory, vol. 52, pp. 23452364, 2006.
14. N. Harvey and R. Kleinberg, "Tighter cut-set bounds for k-pairs communication problems", in Proc. of the Allerton Conference on Communication, Control, and Computing, (Monticello, IL), Sept. 2005.
15. G. Kramer and S. Savari, "Edge-cut bounds on network coding rates", Journal of Network and Systems Mngmnt, vol. 14, pp. 4967, 2006.
16. S. Thakor, A. Grant and T. Chan, "Network Coding Capacity: A Functional Dependence Bound", Int. Symp. Inform. Theory, pp. 263-267, 2009.
17. I. Csizar and J. Korner, "Broadcast channels with confidential messages", IEEE Trans. Info. Theory, vol. IT-24, pp. 339348, May, 1978.