{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:33:24Z","timestamp":1777761204574,"version":"3.51.4"},"reference-count":181,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,3]]},"abstract":"<jats:p>Over the last 70 years, information theory and coding has enabled communication technologies that have had an astounding impact on our lives. This is possible due to the match between encoding\/decoding strategies and corresponding channel models. Traditional studies of channels have taken one of two extremes: Shannon-theoretic models are inherently average-case in which channel noise is governed by a memoryless stochastic process, whereas coding-theoretic (referred to as \u201cHamming\u201d) models take a worst-case, adversarial, view of the noise. However, for several existing and emerging communication systems the Shannon\/average-case view may be too optimistic, whereas the Hamming\/worst-case view may be too pessimistic. This monograph takes up the challenge of studying adversarial channel models that lie between the Shannon and Hamming extremes.<\/jats:p>","DOI":"10.1561\/0100000112","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:51:42Z","timestamp":1733205102000},"page":"300-588","source":"Crossref","is-referenced-by-count":2,"title":["Codes for Adversaries: Between Worst-Case and Average-Case Jamming"],"prefix":"10.1108","volume":"21","author":[{"given":"Bikash Kumar","family":"Dey","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bombay ,","place":["India"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[{"name":"University of Bristol ,","place":["UK"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[{"name":"University at Buffalo ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers University ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Science and Technology Austria ,","place":["Austria"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"2026032712174235800_ref001","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1145\/2591796.2591804","article-title":"Non-malleable codes from additive combinatorics","author":"Aggarwal","year":"2014"},{"issue":"3","key":"2026032712174235800_ref002","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.2307\/2239255","article-title":"A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon\u2019s zero-error capacity","volume":"41","author":"Ahlswede","year":"1970","journal-title":"Annals of Mathematical Statistics"},{"issue":"3","key":"2026032712174235800_ref003","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00535895","article-title":"Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback","volume":"25","author":"Ahlswede","year":"1973","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeit und verwandte Gebiete"},{"issue":"2","key":"2026032712174235800_ref004","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00533053","article-title":"Elimination of correlation in random codes for arbitrarily varying channels","volume":"44","author":"Ahlswede","year":"1978","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"5","key":"2026032712174235800_ref005","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.1986.1057222","article-title":"Arbitrarily varying channels with states sequence known to the sender","volume":"32","author":"Ahlswede","year":"1986","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712174235800_ref006","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/18.104326","article-title":"Two proofs of Pinsker\u2019s conjecture concerning arbitrarily varying channels","volume":"37","author":"Ahlswede","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref007","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/18.749024","article-title":"Arbitrarily varying multiple-access channels part I\u2014Ericson\u2019s symmetrizability is adequate, Gubner\u2019s conjecture is true","volume":"45","author":"Ahlswede","year":"1999","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712174235800_ref008","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0019-9958(69)90157-0","article-title":"Correlated decoding for channels with arbitrarily varying channel probability functions","volume":"14","author":"Ahlswede","year":"1969","journal-title":"Information and Control"},{"key":"2026032712174235800_ref009","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-1-4757-6048-4_15","volume-title":"Numbers, Information and Complexity","author":"Ahlswede","year":"2000"},{"key":"2026032712174235800_ref010","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/ISIT.2006.262057","article-title":"Non-binary error correcting codes with noiseless feedback, localized errors, or both","author":"Ahlswede","year":"2006"},{"issue":"1","key":"2026032712174235800_ref011","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","article-title":"An algorithm for computing the capacity of arbitrary discrete memoryless channels","volume":"18","author":"Arimoto","year":"1972","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712174235800_ref012","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/S0036139993249858","article-title":"Information capacity of channels with partially unknown noise. I. finite-dimensional channels","volume":"56","author":"Baker","year":"1996","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1-3","key":"2026032712174235800_ref013","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0024-3795(99)00271-2","article-title":"Strengthening the Gilbert-Varshamov bound","volume":"307","author":"Barg","year":"2000","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"2026032712174235800_ref014","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TIT.1983.1056602","article-title":"The Gaussian test channel with an intelligent jammer","volume":"29","author":"Ba\u015far","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712174235800_ref015","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/TIT.1985.1057076","article-title":"A complete characterization of minimax and maximin encoder-decoder policies for communication channels with incomplete statistical description","volume":"31","author":"Ba\u015far","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref016","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0042717","volume-title":"Advances in Communications and Signal Processing","author":"Ba\u015far","year":"1989"},{"issue":"1","key":"2026032712174235800_ref017","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/18.42196","article-title":"Optimum linear causal coding schemes for gaussian stochastic processes in the presence of correlated jamming","volume":"35","author":"Ba\u015far","year":"1989","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref018","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00940281","article-title":"Solutions to a class of minimax decision problems arising in communication systems","volume":"51","author":"Ba\u015far","year":"1986","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"2026032712174235800_ref019","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1080\/17442508208833239","article-title":"Optimum coding and decoding schemes for the transmission of a stochastic process over a continuous-time stochastic channel with partially unknown statisticst","volume":"8","author":"Ba\u015far","year":"1982","journal-title":"Stochastics"},{"issue":"4","key":"2026032712174235800_ref020","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"Bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712174235800_ref021","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1137\/1.9781611973402.133","article-title":"Causal erasure channels","author":"Bassily","year":"2014"},{"key":"2026032712174235800_ref022","first-page":"401","article-title":"Effect of jamming on the capacity of MIMO channels","author":"Bayesteh","year":"2004"},{"issue":"10","key":"2026032712174235800_ref023","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1109\/TIT.2002.802612","article-title":"Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem","volume":"48","author":"Bennett","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712174235800_ref024","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","article-title":"Generalized privacy amplification","volume":"41","author":"Bennett","year":"1995","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref025","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM journal on Computing"},{"issue":"2","key":"2026032712174235800_ref026","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM Journal on Computing"},{"key":"2026032712174235800_ref027","unstructured":"E. R.\n              Berlekamp\n            \n          , \u201cBlock coding with noiseless feedback,\u201d Ph.D. dissertation, Massachusetts Institute of Technology, Sep.1964. URL: http:\/\/hdl.handle.net\/1721.1\/14783."},{"key":"2026032712174235800_ref028","doi-asserted-by":"publisher","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"Berman","year":"2003"},{"key":"2026032712174235800_ref029","first-page":"61","article-title":"Communication as a game","author":"Blachman","year":"1957"},{"issue":"4","key":"2026032712174235800_ref030","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1214\/aoms\/1177706106","article-title":"The Capacity of a Class of Channels","volume":"30","author":"Blackwell","year":"1959","journal-title":"Annals of Mathematical Statistics"},{"key":"2026032712174235800_ref031","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1214\/aoms\/1177705783","article-title":"The capacity of a certain channel classes under random coding","volume":"31","author":"Blackwell","year":"1960","journal-title":"Annals of Mathematical Statistics"},{"issue":"4","key":"2026032712174235800_ref032","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/TIT.1972.1054855","article-title":"Computation of channel capacity and rate-distortion functions","volume":"18","author":"Blahut","year":"1972","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref033","first-page":"11","article-title":"Bounds for codes in the case of list decoding of finite volume","volume":"22","author":"Blinovsky","year":"1986","journal-title":"Problems of Information Transmission"},{"key":"2026032712174235800_ref034","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.laa.2014.06.025","article-title":"From seven to eleven: Completely positive matrices with high cp-rank","volume":"459","author":"Bomze","year":"2014","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"2026032712174235800_ref035","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/0323011","article-title":"Some information theoretic saddlepoints","volume":"23","author":"Borden","year":"1985","journal-title":"SIAM Journal on Control and Optimization"},{"key":"2026032712174235800_ref036","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1109\/ISIT44484.2020.9174487","article-title":"Symmetrizability for myopic AVCs","author":"Budkuley","year":"2020"},{"issue":"1","key":"2026032712174235800_ref037","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(67)90052-6","article-title":"Lower bounds to error probability for coding on discrete memoryless channels. part i","volume":"10","author":"Shannon","year":"1967","journal-title":"Information and Control"},{"issue":"5","key":"2026032712174235800_ref038","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/S0019-9958(67)91200-4","article-title":"Lower bounds to error probability for coding on discrete memoryless channels. part ii","volume":"10","author":"Shannon","year":"1967","journal-title":"Information and Control"},{"key":"2026032712174235800_ref039","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s001459900023","article-title":"Linking information reconciliation and privacy amplification","volume":"10","author":"Cachin","year":"1997","journal-title":"Journal of Cryptology"},{"key":"2026032712174235800_ref040","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/2746539.2746591","article-title":"A characterization of the capacity of online (causal) binary channels","author":"Chen","year":"2015"},{"key":"2026032712174235800_ref041","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1109\/ISIT.2016.7541432","article-title":"The capacity of online (causal) q-ary error-erasure channels","author":"Chen","year":"2016"},{"issue":"6","key":"2026032712174235800_ref042","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1109\/TIT.2019.2898863","article-title":"The capacity of online (causal) q-ary error-erasure channels","volume":"65","author":"Chen","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712174235800_ref043","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TIT.2015.2511784","article-title":"Capacity of non-malleable codes","volume":"62","author":"Cheraghchi","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref044","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-015-9219-z","article-title":"Non-malleable coding against bit-wise and split-state tampering","volume":"30","author":"Cheraghchi","year":"2017","journal-title":"Journal of Cryptology"},{"key":"2026032712174235800_ref045","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/CBO9781316106853","volume-title":"Surveys in Combinatorics 2015","author":"Conlon","year":"2015"},{"issue":"5","key":"2026032712174235800_ref046","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref047","volume-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"2026032712174235800_ref048","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","article-title":"Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors","author":"Cramer","year":"2008"},{"issue":"1","key":"2026032712174235800_ref049","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00533715","article-title":"On the capacity of the arbitrarily varying channel for maximum probability of error","volume":"57","author":"Csisz\u00e1r","year":"1981","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"1","key":"2026032712174235800_ref050","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/18.2598","article-title":"Arbitrarily varying channels with constrained inputs and states","volume":"34","author":"Csisz\u00e1r","year":"1988","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref051","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/18.2627","article-title":"The capacity of the arbitrarily varying channel revisited : Positivity, constraints","volume":"34","author":"Csisz\u00e1r","year":"1988","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712174235800_ref052","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/18.32153","article-title":"Capacity and decoding rules for classes of arbitrarily varying channels","volume":"35","author":"Csisz\u00e1r","year":"1989","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref053","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/18.61125","article-title":"Capacity of the Gaussian arbitrarily varying channel","volume":"37","author":"Csisz\u00e1r","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref054","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"2011","edition":"Second"},{"key":"2026032712174235800_ref055","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"Csisz\u00e1r","year":"1984","journal-title":"Statistics and Decisions (Supplement Issue)"},{"issue":"9","key":"2026032712174235800_ref056","doi-asserted-by":"publisher","first-page":"4181","DOI":"10.1109\/TIT.2010.2054651","article-title":"Coordination capacity","volume":"56","author":"Cuff","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712174235800_ref057","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1109\/TIT.2013.2279330","article-title":"Distributed channel synthesis","volume":"59","author":"Cuff","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2026032712174235800_ref058","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The wire-tap channel","volume":"54","author":"Wyner","year":"1975","journal-title":"The Bell System Technical Journal"},{"issue":"6","key":"2026032712174235800_ref059","doi-asserted-by":"publisher","first-page":"3304","DOI":"10.1109\/TIT.2013.2245717","article-title":"Codes against online adversaries: Large alphabets","volume":"59","author":"Dey","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref060","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/ISIT.2015.7282638","article-title":"Sufficiently myopic adversaries are blind","author":"Dey","year":"2015"},{"issue":"9","key":"2026032712174235800_ref061","doi-asserted-by":"publisher","first-page":"5718","DOI":"10.1109\/TIT.2019.2916590","article-title":"Sufficiently myopic adversaries are blind","volume":"65","author":"Dey","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref062","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/ISIT.2019.8849568","article-title":"The interplay of causality and myopia in adversarial channel models","author":"Dey","year":"2019"},{"key":"2026032712174235800_ref063","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284300","article-title":"Improved upper bounds on the capacity of binary channels with causal adversaries","author":"Dey","year":"2012"},{"issue":"6","key":"2026032712174235800_ref064","doi-asserted-by":"publisher","first-page":"3753","DOI":"10.1109\/TIT.2013.2245721","article-title":"Upper bounds on the capacity of binary channels with causal adversaries","volume":"59","author":"Dey","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref065","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/ISIT.2016.7541425","article-title":"A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures","author":"Dey","year":"2016"},{"key":"2026032712174235800_ref066","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/ISIT.2010.5513325","article-title":"Coding against delayed adversaries","author":"Dey","year":"2010"},{"issue":"2","key":"2026032712174235800_ref067","first-page":"18","article-title":"Party problems and Ramsey theory","volume":"56","author":"Do","year":"2019","journal-title":"Vinculum"},{"issue":"6","key":"2026032712174235800_ref068","first-page":"1245","article-title":"Unified information-transmission schemes for discrete memoryless channels and messages with independent components","volume":"148","author":"Dobrushin","year":"1963","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"2","key":"2026032712174235800_ref069","first-page":"97","article-title":"Coding theorems for classes of arbitrarily varying discrete memoryless channels","volume":"11","author":"Dobrushin","year":"1975","journal-title":"Problems of Information Transmission"},{"key":"2026032712174235800_ref070","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1145\/103418.103474","article-title":"Non-malleable cryptography","author":"Dolev","year":"1991"},{"key":"2026032712174235800_ref071","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/ISIT.2006.261676","article-title":"Noisy feedback improves communication reliability","author":"Draper","year":"2006"},{"key":"2026032712174235800_ref072","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-40084-1_14","article-title":"Non-malleable codes from two-source extractors","author":"Dziembowski","year":"2013"},{"issue":"4","key":"2026032712174235800_ref073","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3178432","article-title":"Non-malleable codes","volume":"65","author":"Dziembowski","year":"2018","journal-title":"Journal of the ACM"},{"key":"2026032712174235800_ref074","volume-title":"The Mathematical Theory of Communication","author":"Shannon","year":"1949"},{"issue":"10","key":"2026032712174235800_ref075","doi-asserted-by":"publisher","first-page":"3413","DOI":"10.1109\/TIT.2007.904838","article-title":"Relay networks with delays","volume":"53","author":"El Gamal","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref076","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"issue":"6","key":"2026032712174235800_ref077","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1109\/TIT.1983.1056743","article-title":"Some results on the existence of binary linear codes","volume":"29","author":"Elia","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref078","first-page":"94","article-title":"List decoding for noisy channels","author":"Elias","year":"1957"},{"issue":"1","key":"2026032712174235800_ref079","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/18.61123","article-title":"Error-correcting codes for list decoding","volume":"37","author":"Elias","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref080","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compositio Mathematica"},{"issue":"1","key":"2026032712174235800_ref081","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TIT.1985.1056995","article-title":"Exponential error bounds for random codes in the arbitrarily varying channel","volume":"31","author":"Ericson","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref082","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TIT.2009.2034779","article-title":"Zero-rate feedback can achieve the empirical capacity","volume":"56","author":"Eswaran","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref083","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1080\/09720529.2001.10697920","article-title":"Sharpening the Gilbert-Varshamov bound in the finite case","volume":"4","author":"Fabris","year":"2001","journal-title":"Journal of Discrete Mathematical Sciences and Cryptography"},{"issue":"2","key":"2026032712174235800_ref084","first-page":"119","article-title":"Common information is far less than mutual information","volume":"2","author":"G\u00e1cs","year":"1973","journal-title":"Problems of Control and Information Theory"},{"issue":"1","key":"2026032712174235800_ref085","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"Gel\u2019fand","year":"1980","journal-title":"Problems of Control and Information Theory"},{"key":"2026032712174235800_ref086","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","article-title":"A comparison of signalling alphabets","volume":"31","author":"Gilbert","year":"1952","journal-title":"Bell Systems Technical Journal"},{"issue":"2","key":"2026032712174235800_ref087","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/18.52472","article-title":"On the deterministic-code capacity of the multiple-access arbitrarily varying channel","volume":"36","author":"Gubner","year":"1990","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref088","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/18.61126","article-title":"State Constraints for the Multiple-Access Arbitrarily Varying Channel","volume":"37","author":"Gubner","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref089","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/18.370123","article-title":"Nonconvexity of the Capacity Region of the Multiple-Access Arbitrarily Varying Channel Subject to Constraints","volume":"41","author":"Gubner","year":"1995","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712174235800_ref090","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1109\/TIT.2003.815776","article-title":"List decoding from erasures: bounds and code constructions","volume":"49","author":"Guruswami","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref091","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132516.1132518","article-title":"Explicit capacity-achieving list-decodable codes","author":"Guruswami","year":"2006"},{"issue":"6","key":"2026032712174235800_ref092","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","article-title":"Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes","volume":"45","author":"Guruswami","year":"1999","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref093","doi-asserted-by":"publisher","DOI":"10.1007\/b104335","volume-title":"List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition","author":"Guruswami","year":"2004"},{"issue":"4","key":"2026032712174235800_ref094","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.1109\/TIT.2022.3223023","article-title":"The zero-rate threshold for adversarial bit-deletions is less than 1\/2","volume":"69","author":"Guruswami","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref095","unstructured":"V.\n              Guruswami\n            , A.Rudra, and M.Sudan, \u201cEssential coding theory.\u201d URL: https:\/\/cse.buffalo.edu\/faculty\/atri\/courses\/coding-theory\/book\/."},{"key":"2026032712174235800_ref096","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/FOCS.2010.74","article-title":"Codes for computationally simple channels: Explicit constructions with optimal rate","author":"Guruswami","year":"2010"},{"issue":"6","key":"2026032712174235800_ref097","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1109\/TIT.2013.2246813","article-title":"Linear-Algebraic List Decoding for Variants of Reed-Solomon Codes","volume":"59","author":"Guruswami","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref098","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error detecting and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell Labs Technical Journal"},{"issue":"2","key":"2026032712174235800_ref099","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1049\/piee.1978.0028","article-title":"Improvement on Varshamov-Gilbert lower bound on minimum Hamming distance of linear codes","volume":"125","author":"Hashim","year":"1978","journal-title":"Proceedings of the Institution of Electrical Engineers"},{"issue":"3","key":"2026032712174235800_ref100","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/TIT.1963.1057832","article-title":"Sequential transmission using noiseless feedback","volume":"9","author":"Horstein","year":"1963","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref101","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/ALLERTON.2016.7852297","article-title":"The Gaussian interference channel in the presence of a malicious jammer","author":"Hosseinigoki","year":"2016"},{"key":"2026032712174235800_ref102","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/ISIT44484.2020.9174108","article-title":"Capacity region of the Gaussian arbitrarily-varying broadcast channel","author":"Hosseinigoki","year":"2020"},{"issue":"2","key":"2026032712174235800_ref103","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TIT.1987.1057288","article-title":"Gaussian arbitrarily varying channels","volume":"33","author":"Hughes","year":"1987","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref104","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/18.481780","article-title":"On error exponents for arbitrarily varying channels","volume":"42","author":"Hughes","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712174235800_ref105","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/18.568692","article-title":"The smallest list for the arbitrarily varying channel","volume":"43","author":"Hughes","year":"1997","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref106","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/ISIT.2017.8006576","article-title":"Two-way interference channels with jammers","author":"Jaggi","year":"2017"},{"issue":"2","key":"2026032712174235800_ref107","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.1981.1056320","article-title":"Coding of arbitrarily varying multiuser channels","volume":"27","author":"Jahn","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2026032712174235800_ref108","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1109\/TIT.2004.831751","article-title":"Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes","volume":"50","author":"Jiang","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712174235800_ref109","doi-asserted-by":"publisher","first-page":"2119","DOI":"10.1109\/TIT.2004.833358","article-title":"Correlated jamming on MIMO Gaussian fading channels","volume":"50","author":"Kashyap","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712174235800_ref110","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1109\/TIT.2022.3232241","article-title":"Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound","volume":"69","author":"Kim","year":"2023","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref111","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00383760","article-title":"A strange pigeon-hole principle","volume":"7","author":"Koml\u00f3s","year":"1990","journal-title":"Order"},{"key":"2026032712174235800_ref112","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/FOCS.2019.00028","article-title":"Quasilinear time list-decodable codes for space bounded channels","author":"Kopparty","year":"2019"},{"issue":"6","key":"2026032712174235800_ref113","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/18.720537","article-title":"Zero-error information theory","volume":"44","author":"K\u00f6rner","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"2026032712174235800_ref114","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1109\/TIT.2017.2789292","article-title":"Codes in the space of multisets\u2014coding for permutation channels with impairments","volume":"64","author":"Kova\u010devi\u0107","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712174235800_ref115","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","article-title":"Cooperative strategies and capacity theorems for relay networks","volume":"51","author":"Kramer","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref116","first-page":"87","article-title":"A game-theoretic look at the Gaussian multiaccess channel","author":"La","year":"2003"},{"key":"2026032712174235800_ref117","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51","article-title":"Private codes or succinct random codes that are (almost) perfect","author":"Langberg","year":"2004"},{"issue":"12","key":"2026032712174235800_ref118","doi-asserted-by":"publisher","first-page":"7676","DOI":"10.1109\/TIT.2017.2762676","article-title":"Coding for the $\\ell_\\infty$ -limited permutation channel","volume":"63","author":"Langberg","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712174235800_ref119","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/18.720535","article-title":"Reliable communication under channel uncertainty","volume":"44","author":"Lapidoth","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712174235800_ref120","doi-asserted-by":"crossref","first-page":"2148","DOI":"10.1109\/18.720535","article-title":"Reliable communication under channel uncertainty","volume":"44","author":"Lapidoth","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712174235800_ref121","doi-asserted-by":"publisher","first-page":"2953","DOI":"10.1109\/TIT.2015.2428234","article-title":"An efficient feedback coding scheme with low error probability for discrete memoryless channels","volume":"61","author":"Li","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712174235800_ref122","doi-asserted-by":"publisher","first-page":"7333","DOI":"10.1109\/TIT.2011.2169130","article-title":"Communication over individual channels","volume":"57","author":"Lomnitz","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712174235800_ref123","doi-asserted-by":"publisher","first-page":"6723","DOI":"10.1109\/TIT.2020.3009468","article-title":"Coding theorems for noisy permutation channels","volume":"66","author":"Makur","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref124","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","article-title":"Privacy amplification secure against active adversaries","author":"Maurer","year":"1997"},{"issue":"2","key":"2026032712174235800_ref125","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","article-title":"New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities","volume":"23","author":"McEliece","year":"1977","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref126","first-page":"1043","article-title":"Capacity of correlated jamming channels","author":"M\u00e9dard","year":"1997"},{"key":"2026032712174235800_ref127","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/08-PS141","article-title":"A survey of results for deletion channels and related synchronization channels","volume":"6","author":"Mitzenmacher","year":"2009","journal-title":"Probability Surveys"},{"key":"2026032712174235800_ref128","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/0100000072","volume-title":"Foundations and Trends in Communications and Information Theory","author":"Narayan","year":"2016"},{"issue":"4","key":"2026032712174235800_ref129","doi-asserted-by":"publisher","first-page":"418","DOI":"10.2996\/kmj\/1138845989","article-title":"The strong converse theorem in the decoding scheme of list size L","volume":"21","author":"Nishimura","year":"1969","journal-title":"K\u014ddai Mathematical Seminar Reports"},{"key":"2026032712174235800_ref130","first-page":"15","article-title":"\u00dcber h\u00f6here kongruenzen","volume":"7","author":"\u00d8ystein","year":"1922","journal-title":"Norsk Matematisk Forenings Skrifter Serie I"},{"issue":"2","key":"2026032712174235800_ref131","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TIT.2018.2861776","article-title":"The arbitrarily varying channel under constraints with side information at the encoder","volume":"65","author":"Pereg","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"516","key":"2026032712174235800_ref132","doi-asserted-by":"publisher","DOI":"10.3390\/e21050516","article-title":"The arbitrarily varying relay channel","volume":"21","author":"Pereg","year":"2019","journal-title":"Entropy"},{"issue":"2","key":"2026032712174235800_ref133","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TIT.2019.2927696","article-title":"The arbitrarily varying broadcast channel with causal side information at the encoder","volume":"66","author":"Pereg","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712174235800_ref134","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","article-title":"Binary codes with specified minimum distance","volume":"6","author":"Plotkin","year":"1960","journal-title":"IRE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref135","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","article-title":"Polynomial Codes Over Certain Finite Fields","volume":"8","author":"Reed","year":"1960","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"2026032712174235800_ref136","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-15369-3_52","article-title":"Two theorems on list decoding","author":"Rudra","year":"2010"},{"key":"2026032712174235800_ref137","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1109\/ISIT50566.2022.9834532","article-title":"Channel capacity for adversaries with computationally bounded observations","author":"Ruzomberka","year":"2022"},{"key":"2026032712174235800_ref138","unstructured":"A. D.\n              Sarwate\n            \n          , \u201cRobust and adaptive communication under uncertain interference,\u201d Ph.D. dissertation, University of California, Berkeley, Jul.2008. URL: https:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2008\/EECS-2008-86.pdf."},{"key":"2026032712174235800_ref139","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/CIG.2010.5592896","article-title":"Coding against myopic adversaries","author":"Sarwate","year":"2010"},{"key":"2026032712174235800_ref140","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1109\/ISIT.2006.261933","article-title":"Randomization bounds on Gaussian arbitrarily varying channels","author":"Sarwate","year":"2006"},{"issue":"7","key":"2026032712174235800_ref141","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1109\/TIT.2010.2048497","article-title":"Rateless codes for AVC models","volume":"56","author":"Sarwate","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref142","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1109\/ISIT.2013.6620767","article-title":"Secure cascade channel synthesis","author":"Satpathy","year":"2013"},{"issue":"2","key":"2026032712174235800_ref143","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TIT.1966.1053879","article-title":"A coding scheme for additive noise channels with feedback\u2014part I: No bandwidth constraint","volume":"12","author":"Schalkwijk","year":"1966","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712174235800_ref144","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"Journal of ACM"},{"issue":"10","key":"2026032712174235800_ref145","doi-asserted-by":"publisher","first-page":"4598","DOI":"10.1109\/TIT.2009.2027577","article-title":"Mutual information games in multiuser channels with correlated jamming","volume":"55","author":"Shafiee","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref146","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.45","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)","author":"Shaltiel","year":"2016"},{"key":"2026032712174235800_ref147","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1145\/3406325.3451048","article-title":"Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity.","volume-title":"STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","author":"Shaltiel","year":"2021"},{"key":"2026032712174235800_ref148","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/FOCS54457.2022.00009","article-title":"Error correcting codes that achieve BSC capacity against channels that are poly-size circuits","volume-title":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","author":"Shaltiel","year":"2022"},{"issue":"3","key":"2026032712174235800_ref149","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Technical Journal"},{"issue":"3","key":"2026032712174235800_ref150","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Transactions on Information Theory"},{"issue":"4","key":"2026032712174235800_ref151","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication Theory of Secrecy Systems","volume":"28","author":"Shannon","year":"1949","journal-title":"The Bell System Technical Journal"},{"issue":"3","key":"2026032712174235800_ref152","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TIT.2008.2011434","article-title":"Achieving the empirical capacity using feedback: Memoryless additive models","volume":"55","author":"Shayevitz","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712174235800_ref153","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1109\/TIT.2011.2104992","article-title":"Optimal feedback communication via posterior matching","volume":"57","author":"Shayevitz","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174235800_ref154","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","article-title":"Maximum distance q-nary codes","volume":"10","author":"Singleton","year":"1964","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref155","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","article-title":"On general minimax theorems","volume":"8","author":"Sion","year":"1958","journal-title":"Pacific Journal of Mathematics"},{"key":"2026032712174235800_ref156","first-page":"395","article-title":"Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)","author":"Smith","year":"2007"},{"issue":"2","key":"2026032712174235800_ref157","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1109\/18.2642","article-title":"On the capacity of channels with block memory","volume":"34","author":"Stark","year":"1988","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref158","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","article-title":"Decoding of Reed-Solomon codes beyond the error-correction bound","volume":"13","author":"Sudan","year":"1997","journal-title":"Journal of Complexity"},{"key":"2026032712174235800_ref159","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1109\/ISIT50566.2022.9834509","article-title":"Capacity of noisy permutation channels","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"Tang","year":"2022"},{"issue":"3","key":"2026032712174235800_ref160","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/18.79922","article-title":"Exponential error bounds for random codes on Gaussian arbitrarily varying channels","volume":"37","author":"Thomas","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref161","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1109\/ISIT.2016.7541677","article-title":"Arbitrarily varying networks: Capacity-achieving computationally efficient codes","volume-title":"2016 IEEE International Symposium on Information Theory (ISIT)","author":"Tian","year":"2016"},{"issue":"5","key":"2026032712174235800_ref162","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1109\/18.623158","article-title":"The generalized Gilbert-Varshamov bound is implied by Tur\u00e1n\u2019s theorem [code construction]","volume":"43","author":"Tolhuizen","year":"1997","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174235800_ref163","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/mana.19821090103","article-title":"Modular curves, Shimura curves, and Goppa codes, better than Varshamov- Gilbert bound","volume":"109","author":"Tsfasman","year":"1982","journal-title":"Mathematische Nachrichten"},{"issue":"1","key":"2026032712174235800_ref164","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1017\/S0001867800037605","article-title":"Three-terminal communication channels","volume":"3","author":"van der Meulen","year":"1971","journal-title":"Advances in Applied Probability"},{"issue":"5","key":"2026032712174235800_ref165","first-page":"739","article-title":"The evaluation of signals in codes with correction of errors","volume":"117","author":"Varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"2","key":"2026032712174235800_ref166","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TIT.2017.2768529","article-title":"Strong coordination over multi-hop line networks using channel resolvability codebooks","volume":"64","author":"Vellambi","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712174235800_ref167","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1109\/TIT.2005.853300","article-title":"Improving the Gilbert-Varshamov bound for q-ary codes","volume":"51","author":"Vu","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref168","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/ALLERTON.2016.7852254","article-title":"On the capacity of the binary adversarial wiretap channel","volume-title":"Proceedings of the 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Wang","year":"2016"},{"issue":"6","key":"2026032712174235800_ref169","doi-asserted-by":"publisher","first-page":"3554","DOI":"10.1109\/TIT.2017.2697868","article-title":"On the capacity of the noncausal relay channel","volume":"63","author":"Wang","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref170","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/ISIT.2019.8849324","article-title":"When are large codes possible for AVCs?","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Wang","year":"2019"},{"issue":"1","key":"2026032712174235800_ref171","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0128010","article-title":"On sequences of pairs of dependent random variables","volume":"28","author":"Witsenhausen","year":"1975","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2026032712174235800_ref172","first-page":"90","volume-title":"Quarterly Progress Report, 48","author":"Wozencraft","year":"1958"},{"issue":"2","key":"2026032712174235800_ref173","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.1975.1055346","article-title":"The common information of two dependent random variables","volume":"21","author":"Wyner","year":"1975","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174235800_ref174","doi-asserted-by":"publisher","first-page":"2535","DOI":"10.1109\/ISIT50566.2022.9834632","article-title":"New results on AVCs with omniscient and myopic adversaries","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"Yadav","year":"2022"},{"key":"2026032712174235800_ref175","article-title":"Reliable and secure communication over adversarially jammed multipath networks, Part I: One-shot setting","author":"Zhang","year":"2022"},{"key":"2026032712174235800_ref176","unstructured":"Y.\n              Zhang\n            , S.Jaggi, and A. J.Budkuley, \u201cTight list-sizes for oblivious AVCs under constraints,\u201d ArXiV, Tech. Rep. 2009.03788 [cs.IT], Sep.2020. DOI: 10.48550\/arXiv.2009.03788."},{"key":"2026032712174235800_ref177","doi-asserted-by":"publisher","first-page":"2523","DOI":"10.1109\/ISIT50566.2022.9834709","article-title":"The capacity of causal adversarial channels","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"Zhang","year":"2022"},{"key":"2026032712174235800_ref178","doi-asserted-by":"crossref","unstructured":"Y.\n              Zhang\n            , S.Jaggi, M.Langberg, and A. D.Sarwate, \u201cThe capacity of causal adversarial channels,\u201d ArXiV, Tech. Rep. 2205.06708 [cs.IT], May2022. DOI: 10.48550\/arXiv.2205.06708.","DOI":"10.1109\/ISIT50566.2022.9834709"},{"key":"2026032712174235800_ref179","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/ISIT44484.2020.9174421","article-title":"Quadratically constrained two-way adversarial channels","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Zhang","year":"2020"},{"issue":"2","key":"2026032712174235800_ref180","first-page":"3","article-title":"On the number of correctable errors for transmission over a binary symmetrical channel with feedback","volume":"12","author":"Zigangirov","year":"1976","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712174235800_ref181","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73","volume-title":"EUROSAM 1979: Symbolic and Algebraic Computation","author":"Zippel","year":"1979"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/21\/3-4\/300\/11147030\/0100000112en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/21\/3-4\/300\/11147030\/0100000112en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:46Z","timestamp":1777471846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/21\/3-4\/300\/1332142\/Codes-for-Adversaries-Between-Worst-Case-and"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":181,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2024,12,3]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000112","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]}}}