{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:58:10Z","timestamp":1776977890074,"version":"3.51.4"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tit.2026.3674654","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:23:21Z","timestamp":1773779001000},"page":"2605-2623","source":"Crossref","is-referenced-by-count":0,"title":["Channel-Aware Optimal Transport: A Theoretical Framework for Generative Communication"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4492-1632","authenticated-orcid":false,"given":"Xiqiang","family":"Qu","sequence":"first","affiliation":[{"name":"School of Information and Communication Engineering, North University of China, Taiyuan, Shanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4329-4808","authenticated-orcid":false,"given":"Ruibin","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8084-9332","authenticated-orcid":false,"given":"Jun","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0772-2914","authenticated-orcid":false,"given":"Lei","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Statistics and Data Science, LPMC, KLMDASR, and LEBPS, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/058","volume-title":"Topics in Optimal Transport","author":"Villani","year":"2003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2010.2087749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2286773"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2373382"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450721"},{"key":"ref6","first-page":"1","article-title":"Lossy compression with distribution shift as entropy constrained optimal transport","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Liu"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3229670"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3454239"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00652"},{"key":"ref10","first-page":"675","article-title":"Rethinking lossy compression: The rate-distortion-perception tradeoff","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Blau"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1587\/comex.2018XBL0109"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1587\/comex.2018XBL0139"},{"key":"ref13","first-page":"11682","article-title":"On perceptual lossy compression: The cost of perceptual reconstruction and an optimal training framework","volume-title":"Proc. ACM Int. Conf. Mach. Learn. (ICML)","author":"Yan"},{"key":"ref14","first-page":"1","article-title":"A coding theorem for the rate-distortion-perception function","volume-title":"Proc. Neural Compress. Workshop Int. Conf. Learn. Represent. (ICLR)","author":"Theis"},{"key":"ref15","first-page":"1","article-title":"On the advantages of stochastic encoders","volume-title":"Proc. Neural Compress. Workshop Int. Conf. Learn. Represent. (ICLR)","author":"Theis"},{"key":"ref16","first-page":"11517","article-title":"Universal rate-distortion-perception representations for lossy compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Zhang"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3231820"},{"key":"ref18","article-title":"The rate-distortion-perception tradeoff: The role of common randomness","author":"Wagner","year":"2022","journal-title":"arXiv:2202.04147"},{"key":"ref19","first-page":"1","article-title":"On the choice of perception loss function for learned video compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Salehkalaibar"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3467282"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3462688"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/e27040441"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3509420"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3612287"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2026.3652499"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2919300"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2987203"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3090048"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3191354"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3288243"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056273"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291787"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412540"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453352"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2528279"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2701807"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref38","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Cuturi"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3237073"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2428236"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3063140"},{"key":"ref43","volume-title":"Information Theory: Coding Theory for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"1981"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810631"},{"key":"ref45","volume-title":"Probabilistic Information Theory","author":"Jelinek","year":"1968"},{"key":"ref46","volume-title":"The Theory of Information and Coding","author":"McEliece","year":"1977"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053821"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2401000"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2529657"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541842"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2562630"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11493629\/11436104.pdf?arnumber=11436104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T19:58:23Z","timestamp":1776974303000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11436104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":53,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3674654","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}