{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:35:45Z","timestamp":1780965345480,"version":"3.54.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tit.2018.2865570","type":"journal-article","created":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T18:49:57Z","timestamp":1534445397000},"page":"6967-6978","source":"Crossref","is-referenced-by-count":96,"title":["Strong Functional Representation Lemma and Applications to Coding Theorems"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4803-212X","authenticated-orcid":false,"given":"Cheuk Ting","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-0415","authenticated-orcid":false,"given":"Abbas El","family":"Gamal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055469"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/9781316104477"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104650"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815767"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990840"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.567651"},{"key":"ref37","author":"kingman","year":"1993","journal-title":"Poisson Processes"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541362"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874815"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"ref10","article-title":"Public vs private coin in bounded-round information","volume":"8572","author":"braverman","year":"2014","journal-title":"Automata Languages and Programming—ICALP"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref11","first-page":"755","article-title":"Resolvability in \n$E_\\gamma$\n with applications to lossy compression and wiretap channels","author":"liu","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483192"},{"key":"ref14","first-page":"1457","article-title":"One-shot mutual covering lemma and Marton’s inner bound with a common message","author":"liu","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620787"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620434"},{"key":"ref17","article-title":"Encoding independent sample information sources","volume":"462","author":"pinkston","year":"1967"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055539"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055880"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2529657"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2347282"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057042"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056588"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693077"},{"key":"ref5","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"7","author":"shannon","year":"1959","journal-title":"IRE Int Conv Rec"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1974.tb02812.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057330"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055989"},{"key":"ref9","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"gel\u2019fand","year":"1980","journal-title":"Problems Control Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620306"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438831"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309968"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566172"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref26","article-title":"A direct sum theorem in communication complexity via message compression","volume":"2719","author":"jain","year":"2003","journal-title":"Automata Languages and Programming—ICALP"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/15\/4\/043021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8497120\/08438492.pdf?arnumber=8438492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T15:20:47Z","timestamp":1643210447000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8438492\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":43,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2865570","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}