{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T09:08:54Z","timestamp":1773392934831,"version":"3.50.1"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"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":[[1987,3]]},"DOI":"10.1109\/tit.1987.1057284","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"238-245","source":"Crossref","is-referenced-by-count":90,"title":["Robust transmission of unbounded strings using Fibonacci representations"],"prefix":"10.1109","volume":"33","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"A.","family":"Fraenkel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0135034"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053772"},{"key":"ref12","author":"knuth","year":"1975","journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056387"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2308649"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322237"},{"key":"ref16","first-page":"310","article-title":"On encoding of commas between strings","volume":"22","author":"stone","year":"1979","journal-title":"CACM"},{"key":"ref4","author":"even","year":"1979","journal-title":"Graph Algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2322638"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/359460.359480","article-title":"Economical encoding of commas between strings","volume":"21","author":"even","year":"1978","journal-title":"Comm ACM"},{"key":"ref8","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref7","year":"0"},{"key":"ref2","author":"cassels","year":"1957","journal-title":"An Introduction to Diophantine Approximation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90071-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057587"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22759\/01057284.pdf?arnumber=1057284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T18:03:35Z","timestamp":1753207415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":16,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1987.1057284","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}