{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:44:58Z","timestamp":1748493898032},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"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,9]]},"DOI":"10.1109\/tit.2013.2266333","type":"journal-article","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T18:02:35Z","timestamp":1373479355000},"page":"5488-5510","source":"Crossref","is-referenced-by-count":4,"title":["Universal Communication\u2014Part I: Modulo Additive Channels"],"prefix":"10.1109","volume":"59","author":[{"given":"Yuval","family":"Lomnitz","sequence":"first","affiliation":[]},{"given":"Meir","family":"Feder","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.243445"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283984"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283983"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/EEEI.2010.5662109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref16","first-page":"39","article-title":"A constructive proof of the coding theorem for discrete memoryless channels with feedback","author":"ahlswede","year":"1971","journal-title":"Proc 6th Prague Conf Inf Theory Statist Decis Funct Random Processes"},{"key":"ref17","author":"ooi","year":"1997","journal-title":"A framework for low-complexity communication over channels with feedback"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057068"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034779"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169130"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.705540"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.335960"},{"key":"ref9","article-title":"Universal communication?Part II: Channels with memory","author":"lomnitz","year":"2012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011434"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6579681\/06557005.pdf?arnumber=6557005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:48Z","timestamp":1638218868000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557005\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":20,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2266333","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}