{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:26Z","timestamp":1774679486941,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513325","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"285-289","source":"Crossref","is-referenced-by-count":17,"title":["Coding against delayed adversaries"],"prefix":"10.1109","author":[{"given":"Bikash Kumar","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On computationally bounded adversarial capacity","author":"jung","year":"2006","journal-title":"Proc 2006 Information Theory & Applications Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref12","author":"csisz\u00e1r","year":"1982","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref13","article-title":"Zero-rate feedback can achieve the empirical capacity","volume":"56","author":"eswaran","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"ref4","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 2007 ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)"},{"key":"ref3","article-title":"Robust and adaptive communication under uncertain interference","author":"sarwate","year":"2008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205859"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911217"},{"key":"ref8","article-title":"Explicit capacity-achieving codes for worst-case additive errors","author":"guruswami","year":"0","journal-title":"arXiv 0912 0965vl [cs IT]"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394553"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-30576-7_1","article-title":"Optimal error correction against computationally bounded noise","author":"micali","year":"2005","journal-title":"Proceedings of Theoretical Cryptography Conference (TCC)"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","location":"Austin, TX, USA","start":{"date-parts":[[2010,6,13]]},"end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513325.pdf?arnumber=5513325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T12:53:32Z","timestamp":1497876812000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513325","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}