{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:21Z","timestamp":1774679481334,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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,6]]},"DOI":"10.1109\/tit.2013.2245721","type":"journal-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T18:02:48Z","timestamp":1368640968000},"page":"3753-3763","source":"Crossref","is-referenced-by-count":31,"title":["Upper Bounds on the Capacity of Binary Channels With Causal Adversaries"],"prefix":"10.1109","volume":"59","author":[{"given":"B. K.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Jaggi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. D.","family":"Sarwate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00534915"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535895"},{"key":"ref13","author":"csiszr","year":"1982","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048497"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"ref17","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":"Proc 2007 ACM-SIAM Symp Discrete Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911217"},{"key":"ref19","first-page":"285","article-title":"Coding against delayed adversaries","author":"langberg","year":"2010","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref28","author":"dunham","year":"1990","journal-title":"Journey Through Genius The Great Theorems of Mathematics"},{"key":"ref4","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Academii Nauk"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","article-title":"On the theory of graphs","volume":"3","author":"turn","year":"1954","journal-title":"Colloq Math"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/139","volume":"139","author":"tsfasman","year":"2007","journal-title":"Algebraic Geometric Codes Basic Notions"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033767"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284300"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.74"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394553"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205859"},{"key":"ref26","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref25","volume":"73","author":"alon","year":"2011","journal-title":"The Probabilistic Method"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6516641\/06516725.pdf?arnumber=6516725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:44Z","timestamp":1638218864000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6516725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2245721","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}