{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:05Z","timestamp":1740131705780,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cientfico y Tecnolgico","doi-asserted-by":"publisher","award":["1210315"],"award-info":[{"award-number":["1210315"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/tit.2021.3134891","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T20:42:38Z","timestamp":1639168958000},"page":"2782-2800","source":"Crossref","is-referenced-by-count":5,"title":["On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0256-282X","authenticated-orcid":false,"given":"Jorge F.","family":"Silva","sequence":"first","affiliation":[{"name":"Information and Decision Systems (IDS) Group, University of Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8717-2117","authenticated-orcid":false,"given":"Pablo","family":"Piantanida","sequence":"additional","affiliation":[{"name":"Laboratoire des Signaux et Systèmes (L2S), CNRS, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849410"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/9781933019543"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.272495"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055914"},{"issue":"2","key":"ref7","first-page":"3","article-title":"Optimal coding in the case of unknown and changing message statistics","volume":"2","author":"Fitingof","year":"1966","journal-title":"Problemy Inform. Transmiss."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1966.5167"},{"key":"ref9","first-page":"1","article-title":"Combinatorial methods of universal coding for discrete stationary sources","volume-title":"Proc. 2nd Int. Inf. Theory Symp.","author":"Shtarkov"},{"issue":"4","key":"ref10","article-title":"Method of universal coding for an independent message source with non-exponential computational complexity","volume":"7","author":"Babkin","year":"1971","journal-title":"Problemy Inform. Transmiss."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"issue":"3","key":"ref12","first-page":"28","article-title":"The compression of discrete information","volume":"3","author":"Fitingof","year":"1967","journal-title":"Problemy Inform. Transmiss."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1966.5344"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96262-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008150"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288914"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1030741081"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.54897"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.382017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2455058"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006880"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2941895"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.850664"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541049"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990840"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/0471219282.eot142"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1643-5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.256490"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.817514"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.391272"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.567651"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.904517"},{"issue":"11","key":"ref33","first-page":"2225","article-title":"The redundancy of universal coding with a fidelity criterion","volume":"E80-A","author":"Ishii","year":"1997","journal-title":"IEICE Trans. Fundam. Electron."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800493"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.75241"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10019"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3390\/e20060397"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9737657\/09646872.pdf?arnumber=9646872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T21:14:41Z","timestamp":1709327681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9646872\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3134891","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}