{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:07:23Z","timestamp":1774991243846,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541425","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"880-884","source":"Crossref","is-referenced-by-count":11,"title":["A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures"],"prefix":"10.1109","author":[{"given":"Bikash Kumar","family":"Dey","sequence":"first","affiliation":[{"name":"IIT Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[{"name":"CUHK, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"SUNY Buffalo, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers U., United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref11","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Acad Nauk"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"ref16","first-page":"395","article-title":"Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes","author":"smith","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref18","article-title":"The benefit of a l-bit jump-start, and the necessity of stochastic encoding, in jamming channels","author":"dey","year":"2016","journal-title":"arXiv Tech Rep"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284300"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref3","author":"shannon","year":"1949","journal-title":"The Mathematical Theory of Communication"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90157-0"},{"key":"ref7","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref2","article-title":"A characterization of the capacity of online (causal) binary channels","author":"chen","year":"0","journal-title":"Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing 2015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048497"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.133"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245721"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245717"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205859"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513325"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033767"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875358"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541425.pdf?arnumber=7541425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:54:07Z","timestamp":1774986847000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541425\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541425","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}