{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:53:54Z","timestamp":1778496834636,"version":"3.51.4"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/tit.2013.2238657","type":"journal-article","created":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T22:35:20Z","timestamp":1357770920000},"page":"2545-2575","source":"Crossref","is-referenced-by-count":136,"title":["Lossy Joint Source-Channel Coding in the Finite Blocklength Regime"],"prefix":"10.1109","volume":"59","author":[{"given":"Victoria","family":"Kostina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","volume":"ii","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.817514"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033913"},{"key":"ref10","first-page":"315","article-title":"Joint source-channel error exponent","volume":"9","author":"csiszr","year":"1980","journal-title":"Prob Control Inf Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056585"},{"key":"ref12","author":"pilc","year":"1967","journal-title":"Coding theorems for discrete source-channel pairs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb00065.x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb00062.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90388-9"},{"key":"ref16","first-page":"303","article-title":"An abstract source-channel transmission problem","volume":"12","author":"csiszr","year":"1983","journal-title":"Probl Control Inf Theory"},{"key":"ref17","first-page":"899","article-title":"Random-coding joint source-channel bounds","author":"campo","year":"2011","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120166"},{"key":"ref19","first-page":"57","article-title":"On an extremum problem of information theory","volume":"9","author":"csiszr","year":"1974","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"ref28","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref4","first-page":"93","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053821"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref6","article-title":"Lossless data compression at finite blocklengths","author":"verd","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557285"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310950"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810631"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283533"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2341-0"},{"key":"ref22","author":"tomamichel","year":"2012","journal-title":"A Tight Upper Bound for the Third-Order Asymptotics of Discrete Memoryless Channels ArXiv eprint arXiv 1212 3689"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.370119"},{"key":"ref24","author":"polyanskiy","year":"2010","journal-title":"Channel Coding Non-Asymptotic Fundamental Limits"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054145"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref25","author":"jelinek","year":"1968","journal-title":"Probabilistic Information Theory Discrete and Memoryless Models"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6504538\/06408177.pdf?arnumber=6408177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:42Z","timestamp":1638218862000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6408177\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":32,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2238657","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}