{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:21Z","timestamp":1730274561602,"version":"3.28.0"},"reference-count":2,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365130","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:17Z","timestamp":1103776457000},"page":"93-93","source":"Crossref","is-referenced-by-count":3,"title":["Variable-to-variable codes with small redundancy rates"],"prefix":"10.1109","author":[{"given":"M.","family":"Drmota","sequence":"first","affiliation":[]},{"given":"W.","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.771231"},{"key":"ref1","first-page":"21","article-title":"Bounds of redundancy estimates for word-based encoding of sequences produced by a Bernoulli source (Russian)","volume":"8","author":"khodak","year":"1972","journal-title":"Problemy Peredachi Informacii"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365130.pdf?arnumber=1365130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T23:43:02Z","timestamp":1489448582000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365130\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":2,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365130","relation":{},"subject":[]}}