The common information of N dependent random variables

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 836-843

  Wei, Liu ^a   Ge, Xu ^a   Biao, Chen ^a  

^a SYRACUSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-MONOTONE; CODING THEOREMS; COMMON INFORMATION; COMMON RANDOMNESS; GRAY-WYNER SOURCE CODING; MUTUAL INFORMATIONS;

GALLIUM; NETWORK CODING;

RANDOM VARIABLES;

EID: 79952377927     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706995     Document Type: Conference Paper

References (16)

1. P. Gács and J. Körner, "Common information is much less than mutual information", Problems Contr. Inform. Theory, vol. 2, pp. 149-162, 1973.
2. R. Ahlswede and J. Körner, "On common information and related characteristics of correlated information sources", Proc. of the 7th Prague Conference of Information Theory, 1974.
3. H. S. Witsenhausen, "On sequences of pairs of dependent random variables", SIAM J. Appl. Math., vol. 28, pp. 100-113, Jan. 1975.
4. A. D. Wyner, "The common information of two dependent random variables", IEEE Trans. Inf. Theory, vol. 21, no. 2, pp. 163-179, March. 1975.
5. H. S. Witsenhausen, "Values and bounds for the common information of two discrete random variables", SIAM J. Appl. Math., vol. 31, no. 2, pp. 313-333, 1976.
6. C. E. Shannon, "A mathematical theory of communication", Bell System Technical Journal, vol. 27, pp. 379-423, 1948.
7. R. Ahlswede and I. Csiszár, "Common randomness in information thoery and cryptography, Part I: Secret sharing", IEEE Trans. Inf. Theory, vol. 39, pp. 1121-1132, July 1993.
8. R. Ahlswede and I. Csiszár, "Common randomness in information thoery and cryptography, Part I: CR capacity", IEEE Trans. Inf. Theory, vol. 44, pp. 225-240, Jan. 1998.
9. U. M. Maurer, "Secret key agreement by public discussion from common information", IEEE Trans. Inf. Theory, vol. 39, pp. 733-742, May 1993.
10. G. Hu "On the amount of information", Teor. Veroyatnost. i Primenen., 4: 447-455, 1962 (in Russian).
11. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic, New York, 1981.
12. R. W. Yeung, Information Theory and Network Coding, Springer, 2008.
13. H. Tyagi and P. Narayan and P. Gupta, "When is a Function Securely Computable? ", http://arxiv.org/abs/1007.2945, 2010.
14. R. M. Gray and A. D. Wyner, "Source coding for a simple network", Bell Syst. Tech. J., vol. 58, pp. 1681-1721, Nov. 1974.
15. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, New York, 1991.
16. A. El Gamal and Y. H. Kim, Lecture notes on network information theory, http://arxiv.org/abs/1001.3404, 2010.