{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:44Z","timestamp":1755220004369,"version":"3.43.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437771","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2211-2215","source":"Crossref","is-referenced-by-count":0,"title":["Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints"],"prefix":"10.1109","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[{"name":"Andrew and Erna Viterbi Faculty of Electrical Engineering Technion- Israel Institute of Technology, Haifa, 32000, Israel"}]},{"given":"Sergio","family":"Verd\u00fa","sequence":"additional","affiliation":[{"name":"Princeton University, Department of Electrical Engineering, New Jersey, 08544, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438831"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394764"},{"key":"ref12","first-page":"547","article-title":"On measures of entropy and information","author":"r\u00e9nyi","year":"1961","journal-title":"Proc 4th Berkeley Symp Probability Theory and Mathematical Statistics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365269"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/11593447_11","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","volume":"3788","author":"renner","year":"2005","journal-title":"Advances in Cryptology - ASIACRYPT 2005 Lecture Notes in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2803162"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref17","first-page":"689","article-title":"Asymptotische abschäzungen in Shannon's informationstheorie","author":"strassen","year":"1964","journal-title":"Transactions of the Third Prague Conference on Information Theory Statistics Decision Functions Random Processes (Liblice 1962)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145590"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544907"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00537132"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0019-9958(65)90332-3","article-title":"A coding theorem and Rényi's entropy","volume":"8","author":"campbell","year":"1965","journal-title":"Information and Control"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875284"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875283"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844098"},{"key":"ref2","first-page":"41","article-title":"Information measures and capacity of order a for discrete memoryless channels","volume":"16","author":"arimoto","year":"1977","journal-title":"Topics in Information Theory - 2nd Colloquium Keszthely Hungary 1975 Colloquia Mathematica Societatis Janós Bolyai (I Csiszár and P Elias editors)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.481781"},{"key":"ref9","first-page":"745","article-title":"On the smooth Rényi entropy and variable-length source coding allowing errors","author":"kuzuoka","year":"2016","journal-title":"Proc 2016 IEEE Int Symp Inf Theory"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437771.pdf?arnumber=8437771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:31Z","timestamp":1754588551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437771\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437771","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}