{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:46Z","timestamp":1773376906411,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"US NSF","doi-asserted-by":"publisher","award":["CCF-1909451,CCF-1909468"],"award-info":[{"award-number":["CCF-1909451,CCF-1909468"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619362","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1586-1591","source":"Crossref","is-referenced-by-count":0,"title":["Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs"],"prefix":"10.1109","author":[{"given":"B. K.","family":"Dey","sequence":"first","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Jaggi","sequence":"additional","affiliation":[{"name":"University of Bristol"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Langberg","sequence":"additional","affiliation":[{"name":"SUNY Buffalo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Zhang","sequence":"additional","affiliation":[{"name":"IST Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"3","key":"ref1","first-page":"220","article-title":"Coloring Hypergraphs: A New Approach fo Multi-user Source Coding - II","volume":"5","author":"Ahlswede","year":"1980","journal-title":"Journal of Combinatorics, Information and System Sciences"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705783"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"issue":"2","key":"ref5","first-page":"3","article-title":"Coding theorems for classes of discrete memoryless arbitrarily time-variable channels","volume":"11","author":"Dobru\u0161in","year":"1975","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1985.1056995"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.32153"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_183"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2936015"},{"key":"ref11","first-page":"45:1","article-title":"Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2016), ser. Leibniz International Proceedings in Informatics (LIPIcs)","volume":"60","author":"Shaltiel","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2019.00028"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451048"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-020-00203-w"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/focs54457.2022.00009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49175-2_9"},{"issue":"9","key":"ref17","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1093\/comjnl\/bxy100","article-title":"Error Correction by Structural Simplicity: Correcting Samplable Additive Errors","volume":"62","author":"Yasunaga","year":"2018","journal-title":"The Computer Journal"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3330811"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/isit54713.2023.10206731"},{"key":"ref20","article-title":"Computationally efficient codes for strongly Dobrushin-Stambler non-symmetrizable oblivious AVCs","author":"Dey","journal-title":"2024, in preparation"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1098-2418(199809)13:2<99::aid-rsa1>3.0.co;2-m"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619362.pdf?arnumber=10619362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:10Z","timestamp":1773347350000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619362\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619362","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}