{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:15:14Z","timestamp":1764173714986,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706995","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T21:50:52Z","timestamp":1296769852000},"page":"836-843","source":"Crossref","is-referenced-by-count":30,"title":["The common information of N dependent random variables"],"prefix":"10.1109","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ge","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Biao","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"447","article-title":"On the amount of information","volume":"4","author":"hu","year":"1962","journal-title":"Teor Veroyatnost i Primenen"},{"article-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref11"},{"article-title":"Information Theory and Network Coding","year":"2008","author":"yeung","key":"ref12"},{"article-title":"When is a Function Securely Computable?","year":"2010","author":"tyagi","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1974.tb02812.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"journal-title":"Lecture notes on network information theory","year":"2010","author":"gamal","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0128010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0131026"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.651026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref2","article-title":"On common information and related characteristics of correlated information sources","author":"ahlswede","year":"1974","journal-title":"7th Prague Conf Information Theory"},{"key":"ref1","first-page":"149","article-title":"Common information is much less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Problems Contr Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706995.pdf?arnumber=5706995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T06:16:57Z","timestamp":1490077017000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706995","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}