{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:32:29Z","timestamp":1774020749431,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tit.2018.2862354","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T18:53:52Z","timestamp":1533149632000},"page":"276-291","source":"Crossref","is-referenced-by-count":13,"title":["Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost"],"prefix":"10.1109","volume":"65","author":[{"given":"Lin","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7980-724X","authenticated-orcid":false,"given":"Fady","family":"Alajaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9993-816X","authenticated-orcid":false,"given":"Tamas","family":"Linder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"sabag","year":"2017","journal-title":"Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146350"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008147"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917685"},{"key":"ref31","article-title":"Directed information for channels with feedback","author":"kramer","year":"1998"},{"key":"ref30","first-page":"303","article-title":"Causality, feedback, and directed information","author":"massey","year":"1990","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331951"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924681"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842697"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009849"},{"key":"ref28","author":"pinsker","year":"1964","journal-title":"Information and Information Stability of Random Variables and Processes"},{"key":"ref27","first-page":"323","article-title":"General formulation of Shannon&#x2019;s main theorem in information theory","volume":"33","author":"dobrushin","year":"1963","journal-title":"Amer Math Soc Trans"},{"key":"ref29","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.03.060468"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006519"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.904502"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.335960"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.370168"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.395079"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.841196"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541502"},{"key":"ref50","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","author":"shannon","year":"1959","journal-title":"IRE Nat Conv Rec"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref52","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.45284"},{"key":"ref11","article-title":"Optimal codes for the burst erasure channel","author":"hamkins","year":"2008"},{"key":"ref40","author":"blahut","year":"1988","journal-title":"Principles and Practice of Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2326661"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282684"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2495239"},{"key":"ref15","author":"li","year":"2016","journal-title":"Asymptotics of input-constrained erasure channel capacity"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133161"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.340476"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901184"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2004.832413"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513593"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2009.2023233"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216501"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1960.tb03959.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2388191"},{"key":"ref49","author":"berger","year":"1971","journal-title":"Rate Distortion Theory A Mathematical Basis for Data Compression"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1963.tb00955.x"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.1007\/978-981-10-8001-2","author":"alajaji","year":"2018","journal-title":"An Introduction to Single-User Information Theory"},{"key":"ref45","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054699"},{"key":"ref47","first-page":"94","article-title":"Memory increases transmission capacity","volume":"5","author":"dobrushin","year":"1969","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref41","author":"mceliece","year":"1977","journal-title":"The Theory of Information and Coding A Mathematical Framework for Communication"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.370119"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8581519\/08424211.pdf?arnumber=8424211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:59Z","timestamp":1657746539000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8424211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":52,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2862354","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}