{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:46Z","timestamp":1773376606782,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206731","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"228-233","source":"Crossref","is-referenced-by-count":2,"title":["Computationally Efficient Codes for Adversarial Binary-Erasure Channels"],"prefix":"10.1109","author":[{"given":"Sijie","family":"Li","sequence":"first","affiliation":[{"name":"UT Austin"}]},{"given":"Prasad","family":"Krishnan","sequence":"additional","affiliation":[{"name":"IIIT Hyderabad"}]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[{"name":"University of Bristol"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"University at Buffalo"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers University"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205859"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513325"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2011.6033767"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284300"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245721"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245717"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.133"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746591"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2015.7282912"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2016.7541432"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2016.7541425"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT50566.2022.9834709","article-title":"The capacity of causal adversarial channels","author":"Zhang","year":"2022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3158230"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592896"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2916590"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2019.8849568"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17470-9_13"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2503766"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/allerton.2016.7852254"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2936015"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.74"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2014.6875358"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451048"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-020-00203-w"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2019.00028"},{"key":"ref29","article-title":"Error correcting codes that achieve BSC capacity against channels that are poly-size circuits","volume-title":"Electron. Colloquium Comput. Complex.","volume":"TR22-117","author":"Shaltiel","year":"2022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834532"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746591"},{"key":"ref32","article-title":"A characterization of the capacity of online (causal) binary channels","volume-title":"CoRR","author":"Chen","year":"2014"},{"key":"ref33","article-title":"Polynomial-time codes for adversarial binary-erasure channels","author":"Li","journal-title":"extended manuscript under preparation"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206731.pdf?arnumber=10206731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:52Z","timestamp":1773347212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206731\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206731","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}