{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:08Z","timestamp":1740131708305,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israeli Science Foundation","doi-asserted-by":"publisher","award":["12\/12"],"award-info":[{"award-number":["12\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO-MURI","doi-asserted-by":"publisher","award":["W911NF-15-1-0479"],"award-info":[{"award-number":["W911NF-15-1-0479"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"Center for Science of Information, NSF Science and Technology Center","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tit.2018.2803162","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T19:20:35Z","timestamp":1518031235000},"page":"4323-4346","source":"Crossref","is-referenced-by-count":48,"title":["Improved Bounds on Lossless Source Coding and Guessing Moments via R\u00e9nyi Measures"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5681-1273","authenticated-orcid":false,"given":"Igal","family":"Sason","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1254-9116","authenticated-orcid":false,"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"2985","article-title":"Sharp bounds on Arimoto’s conditional Rényi entropies between two distinct orders","author":"sakai","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref38","first-page":"547","article-title":"On measures of entropy and information","author":"r\u00e9nyi","year":"1961","journal-title":"Proc 4th Berkeley Symp on Math Statist Probability"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.782106"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.550316"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394764"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824921"},{"key":"ref37","first-page":"199","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","volume":"3788","author":"renner","year":"2005","journal-title":"Adv Cryptology"},{"key":"ref36","first-page":"232","article-title":"Smooth Rényi entropy and applications","author":"renner","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2757495"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"343","DOI":"10.4310\/CIS.2011.v11.n4.a3","article-title":"On optimum strategies for minimizing exponential moments for a given cost function","volume":"11","author":"merhav","year":"2011","journal-title":"Commun Inf Syst"},{"key":"ref28","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 IEEE Int Symp Inf Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438831"},{"journal-title":"Linear Algebra","year":"1987","author":"lang","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.669158"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.481781"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2357799"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090221"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.01.089"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844098"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006930"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691332"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544907"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006929"},{"key":"ref10","first-page":"1","article-title":"Maximizing Rényi entropy rate","author":"bunte","year":"2014","journal-title":"Proc IEEE 28th Convent Electr Electron Eng Israel"},{"journal-title":"Reducing guesswork via an unreliable oracle","year":"2017","author":"burin","key":"ref11"},{"key":"ref40","first-page":"2263","article-title":"Centralized versus decentralized multi-agent guesswork","author":"salamatian","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref12","first-page":"193","volume":"1233","author":"cachin","year":"1997","journal-title":"Smooth Entropy and Rényi Entropy"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90332-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00537132"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875283"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875284"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/0100000090"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref4","first-page":"41","article-title":"Information measures and capacity of order \n$\\alpha $\n for discrete memoryless channels","volume":"16","author":"arimoto","year":"1977","journal-title":"Topics in Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.705557"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.641578"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/130939730"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006878"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282723"},{"key":"ref49","article-title":"Shannon’s inequality","author":"verd\u00fa","year":"2011","journal-title":"Proc Workshop Inf Theory Appl"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329490"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887466"},{"key":"ref45","first-page":"689","article-title":"Asymptotische abschäzungen in Shannon’s informations-theorie","author":"strassen","year":"1964","journal-title":"Proc Trans 3rd Prague Conf Inf Theory Stat Decision Funct Random Process (Liblice)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145590"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557309"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2757496"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2603151"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034266"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1147\/rd.24.0289","article-title":"Channels with side information at the transmitter","volume":"2","author":"shannon","year":"1958","journal-title":"IBM J Res Develop"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8361085\/8283787-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8361085\/08283787.pdf?arnumber=8283787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:16Z","timestamp":1649444116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8283787\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":51,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2803162","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}