{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:33:33Z","timestamp":1774679613469,"version":"3.50.1"},"reference-count":193,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Simons Investigator Award"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1715187"],"award-info":[{"award-number":["CCF 1715187"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Science and Technology, India","award":["EMR\/2016\/002569"],"award-info":[{"award-number":["EMR\/2016\/002569"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16H06091"],"award-info":[{"award-number":["16H06091"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/tit.2019.2946364","type":"journal-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T20:12:29Z","timestamp":1570738349000},"page":"5-37","source":"Crossref","is-referenced-by-count":33,"title":["Communication for Generating Correlation: A Unifying Survey"],"prefix":"10.1109","volume":"66","author":[{"given":"Madhu","family":"Sudan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-8633","authenticated-orcid":false,"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400994"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2132130"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.032312"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2271772"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1145\/2789149.2789161"},{"key":"ref176","article-title":"Compression of sources of probability distributions and density operators","author":"winter","year":"2002","journal-title":"CoRR"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/45\/45\/453001"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1137\/0128010"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-003-0989-z"},{"key":"ref168","first-page":"36","article-title":"Various techniques used in connection with random digits","volume":"12","author":"von neumann","year":"1951","journal-title":"Appl Math Ser"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875160"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2347282"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.86"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2134067"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-011-1309-7"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488628"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483456"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF00532234"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5802\/aif.357"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055374"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2917182"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007028"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2428236"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351812"},{"key":"ref187","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"yao","year":"1979","journal-title":"Proc 16 Annual Symp Theory of Comput"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904500"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.3824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309968"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921674"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541457"},{"key":"ref22","first-page":"30:1","article-title":"Optimal deterministic extractors for generalized Santha–Vazirani sources","volume":"116","author":"beigi","year":"2018","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref21","article-title":"Complete classification of generalized Santha–Vazirani sources","author":"beigi","year":"2017","journal-title":"CoRR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806965"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/15M1027206"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref50","article-title":"On tightness of mutual dependence upperbound for secret-key capacity of multiple terminals","author":"chan","year":"2008","journal-title":"arXiv 0805 3200"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120167"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700153"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2529657"},{"key":"ref150","first-page":"199","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","author":"renner","year":"2005","journal-title":"Proc ASIACRYPT"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1007\/BF02024507"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162226"},{"key":"ref148","article-title":"Security of quantum key distribution","author":"renner","year":"2005"},{"key":"ref149","first-page":"562","article-title":"New bounds in secret-key agreement: The gap between formation and secrecy extraction","author":"renner","year":"2003","journal-title":"Proc EUROCRYPT"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"ref58","first-page":"48","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref57","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323246"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897528"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2301155"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283585"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.85"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00165-4"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1109\/18.825797"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1109\/18.651022"},{"key":"ref164","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000010","article-title":"Pseudorandomness","volume":"7","author":"vadhan","year":"2012","journal-title":"Found Trends Theor Comput Sci"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746859"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437605"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694850"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.42172"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.651026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055469"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995937"},{"key":"ref159","first-page":"369","article-title":"A bound for multiparty secret key agreement and implications for a problem of secure computing","author":"tyagi","year":"2014","journal-title":"Proc EUROCRYPT"},{"key":"ref8","article-title":"On maximal correlation, hypercontractivity, and the data processing inequality studied by Erkip and Cover","author":"anantharam","year":"2013","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2007.03.010"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736497"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483335"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-009-0001-y"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-004-0002-2"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.66.042309"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref42","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc Compression and Complexity of Sequences (SEQUENCES '97)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214025"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.665"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.86.419"},{"key":"ref73","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2357799"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/2907939"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19410210604"},{"key":"ref74","first-page":"277","article-title":"When are fuzzy extractors possible?","author":"fuller","year":"2016","journal-title":"Proc ASIACRYPT"},{"key":"ref75","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Problems Control Inf Theory"},{"key":"ref78","first-page":"1834","article-title":"Resource-efficient common randomness and secret-key schemes","author":"ghazi","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.65"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216254"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054651"},{"key":"ref67","first-page":"2728","article-title":"Non interactive simulation of correlated distributions is decidable","author":"de","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1063\/1.1495917"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806569"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2567440"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2535174"},{"key":"ref190","article-title":"Information theoretic generation of multiple secret keys","author":"ye","year":"2005"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278971"},{"key":"ref191","article-title":"Exact channel synthesis","author":"yu","year":"2018","journal-title":"arXiv 1810 13246"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110950"},{"key":"ref192","article-title":"On exact and ?-Rényi common information","author":"yu","year":"2018","journal-title":"arXiv 1810 00295"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.81.865"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2013.6621596"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100013517"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"ref82","article-title":"Coding for positive rate in the source model key agreement problem","author":"gohari","year":"2017","journal-title":"arXiv 1709 05174"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050925"},{"key":"ref84","first-page":"6:1","article-title":"Tight bounds for communication-assisted agreement distillation","author":"guruswami","year":"2016","journal-title":"Proc 31st Conf Comput Complex (CCC)"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.2307\/2373688"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034824"},{"key":"ref85","first-page":"2659","article-title":"Simulation of a channel with another channel","volume":"63","author":"haddadpour","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref86","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","volume":"50","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref88","first-page":"9","article-title":"Spectrum invariancy under output approximation for discrete memoryless channels with full rank","volume":"29","author":"han","year":"1993","journal-title":"Problems Inf Transmiss"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2597853"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/18.748999"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref125","first-page":"1","article-title":"Finding similar files in a large file system","author":"maurer","year":"1994","journal-title":"Proc USENIX Winter Tech Conf"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196022"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref128","first-page":"351","article-title":"Information-theoretic key agreement: From weak to strong secrecy for free","author":"maurer","year":"2000","journal-title":"Proc EUROCRYPT"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.53"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309140"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2589"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2010.171.295"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533546"},{"key":"ref136","article-title":"Equivalent formulations of hypercontractivity using information measures","author":"nair","year":"0"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883552"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1561\/0100000072"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219158"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715906"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1993.748470"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628307"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref145","author":"rao","year":"0","journal-title":"Communication Complexity"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874815"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055800"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025545"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"ref105","article-title":"Multi-party protocols, information complexity and privacy","author":"kerenidis","year":"2016","journal-title":"arXiv 1606 06872"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057118"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04268-8_7"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735438"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref110","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553672"},{"key":"ref11","article-title":"Nearest neighbors in high-dimensional spaces","author":"andoni","year":"2016","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref12","first-page":"1861","article-title":"Communication-rounds tradeoffs for common randomness secret key generation","author":"bafna","year":"2019","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref14","author":"barak","year":"2007","journal-title":"Lecture Notes for Complexity Theory (Princeton CS 522) Handout 10 Parallel Repetition Lemma"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006667"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/100811969"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746104"},{"key":"ref17","article-title":"The optimality of correlated sampling","author":"bavarian","year":"2016","journal-title":"CoRR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/1970980"},{"key":"ref119","article-title":"Multi-user and wiretap channels including feedback","author":"liung-yan-cheong","year":"1976"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282882"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.3390\/e20060418"},{"key":"ref113","article-title":"Information theory from a functional viewpoint","author":"liu","year":"2018"},{"key":"ref116","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/TIT.2015.2507602","article-title":"Key capacity for product sources with application to stationary Gaussian processes","volume":"62","author":"liu","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282547"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011424"},{"key":"ref121","first-page":"51","article-title":"Two-terminal distributed source coding with alternating messages for function computation","author":"ma","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251412"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8939138\/8863950-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8939138\/08863950.pdf?arnumber=8863950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:20:09Z","timestamp":1651080009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8863950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":193,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2946364","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}