{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:06:26Z","timestamp":1648893986061},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"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,4]]},"DOI":"10.1109\/tit.2012.2236915","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T19:05:14Z","timestamp":1356721514000},"page":"2375-2395","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables"],"prefix":"10.1109","volume":"59","author":[{"given":"Fr\u00e9d\u00e9rique","family":"Bassino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Clement","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadiel","family":"Seroussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Viola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90648-8"},{"key":"ref11","author":"baer","year":"2003","journal-title":"Coding for General Penalties"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798343908"},{"key":"ref13","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref14","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1997.581993"},{"key":"ref4","author":"rice","year":"1979","journal-title":"Some practical universal noiseless coding techniques"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.817513"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.641571"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/83.855427"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666911"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.490559"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055357"},{"key":"ref9","author":"golin","year":"2004","journal-title":"Algorithms for constructing infinite Huffman codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053907"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6479338\/06397616.pdf?arnumber=6397616","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\/6397616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":15,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2236915","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}