{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:23:50Z","timestamp":1775017430698,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1134\/s0032946021020010","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T13:04:50Z","timestamp":1625663090000},"page":"99-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel"],"prefix":"10.1134","volume":"57","author":[{"given":"A. S.","family":"Vora","sequence":"first","affiliation":[]},{"given":"A. A.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"5019_CR1","doi-asserted-by":"publisher","unstructured":"Vora, A.S. and Kulkarni, A.A., A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC, in 2019 National Conf. on Communications (NCC 2019), Bangalore, India, Feb. 20\u201323, 2019, pp.\u00a01\u20136. https:\/\/doi.org\/10.1109\/NCC.2019.8732205","DOI":"10.1109\/NCC.2019.8732205"},{"issue":"6","key":"5019_CR2","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1109\/JIOT.2017.2703172","volume":"4","author":"A Humayed","year":"2017","unstructured":"Humayed, A., Lin, J., Li, F., and Luo, B., Cyber-Physical Systems Security\u2014A Survey, IEEE Internet of Things J., 2017, vol.\u00a04, no.\u00a06, pp.\u00a01802\u20131831. https:\/\/doi.org\/10.1109\/JIOT.2017.2703172","journal-title":"IEEE Internet of Things J."},{"key":"5019_CR3","doi-asserted-by":"publisher","unstructured":"Slay, J. and Miller, M., Lessons Learned from the Maroochy Water Breach, Critical Infrastructure Protection (Proc. Int. Conf. ICCIP\u20132007, Hanover, NH, USA, Mar. 19\u201321, 2007), Goetz, E. and Shenoi, S., Eds., Boston: Springer, 2008. https:\/\/doi.org\/10.1007\/978-0-387-75462-8_6","DOI":"10.1007\/978-0-387-75462-8_6"},{"issue":"3","key":"5019_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MSP.2011.67","volume":"9","author":"R Langner","year":"2011","unstructured":"Langner, R., Stuxnet: Dissecting a Cyberwarfare Weapon, IEEE Secur. Priv., 2011, vol.\u00a09, no.\u00a03, pp.\u00a049\u201351. https:\/\/doi.org\/10.1109\/MSP.2011.67","journal-title":"IEEE Secur. Priv."},{"key":"5019_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794216","volume-title":"Game Theory","author":"M Maschler","year":"2013","unstructured":"Maschler, M., Solan, E., and Zamir, S., Game Theory, Cambridge: Cambridge Univ. Press, 2013."},{"issue":"4","key":"5019_CR6","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/TAC.2014.2362596","volume":"60","author":"AA Kulkarni","year":"2015","unstructured":"Kulkarni, A.A. and Coleman, T.P., An Optimizer\u2019s Approach to Stochastic Control Problems with Nonclassical Information Structures, IEEE Trans. Autom. Control, 2015, vol.\u00a060, no.\u00a04, pp.\u00a0937\u2013949. https:\/\/doi.org\/10.1109\/TAC.2014.2362596","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"5019_CR7","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1214\/aoms\/1177696979","volume":"41","author":"R Ahlswede","year":"1970","unstructured":"Ahlswede, R., 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, Ann. Math. Statist., 1970, vol.\u00a041, no.\u00a03, pp.\u00a01027\u20131033. https:\/\/doi.org\/10.1214\/aoms\/1177696979","journal-title":"Ann. Math. Statist."},{"issue":"5","key":"5019_CR8","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","volume":"56","author":"Y Polyanskiy","year":"2010","unstructured":"Polyanskiy, Y., Poor, H.V., and Verd\u00fa, S., Channel Coding Rate in the Finite Blocklength Regime, IEEE Trans. Inform. Theory, 2010, vol.\u00a056, no.\u00a05, pp.\u00a02307\u20132359. https:\/\/doi.org\/10.1109\/TIT.2010.2043769","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5019_CR9","doi-asserted-by":"publisher","first-page":"2545","DOI":"10.1109\/TIT.2013.2238657","volume":"59","author":"V Kostina","year":"2013","unstructured":"Kostina, V. and Verd\u00fa, S., Lossy Joint Source-Channel Coding in the Finite Blocklength Regime, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a05, pp.\u00a02545\u20132575. https:\/\/doi.org\/10.1109\/TIT.2013.2238657","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5019_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csisz\u00e1r","year":"2011","unstructured":"Csisz\u00e1r, I. and K\u00f6rner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge, UK: Cambridge Univ. Press, 2011, 2nd ed."},{"key":"5019_CR11","doi-asserted-by":"publisher","unstructured":"Kosut, O. and Kliewer, J., Finite Blocklength and Dispersion Bounds for the Arbitrarily-Varying Channel, in Proc. 2018 IEEE Int. Symp. on Information Theory (ISIT\u20132018), Vail, CO, USA, June 17\u201322, 2018, pp.\u00a02007\u20132011. https:\/\/doi.org\/10.1109\/ISIT.2018.8437724","DOI":"10.1109\/ISIT.2018.8437724"},{"issue":"11","key":"5019_CR12","doi-asserted-by":"publisher","first-page":"7066","DOI":"10.1109\/TIT.2017.2738634","volume":"63","author":"ST Jose","year":"2017","unstructured":"Jose, S.T. and Kulkarni, A.A., Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding, IEEE Trans. Inform. Theory, 2017, vol.\u00a063, no.\u00a011, pp.\u00a07066\u20137094. https:\/\/doi.org\/10.1109\/TIT.2017.2738634","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5019_CR13","doi-asserted-by":"publisher","first-page":"2423","DOI":"10.1109\/TIT.2018.2873623","volume":"65","author":"ST Jose","year":"2019","unstructured":"Jose, S.T. and Kulkarni, A.A., Improved Finite Blocklength Converses for Slepian\u2013Wolf Coding via Linear Programming, IEEE Trans. Inform. Theory, 2019, vol.\u00a065, no.\u00a04, pp.\u00a02423\u20132441. https:\/\/doi.org\/10.1109\/TIT.2018.2873623","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5019_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/0323011","volume":"23","author":"JM Borden","year":"1985","unstructured":"Borden, J.M., Mason, D.M., and McEliece, R.J., Some Information Theoretic Saddlepoints, SIAM J. Control Optim., 1985, vol.\u00a023, no.\u00a01, pp.\u00a0129\u2013143. https:\/\/doi.org\/10.1137\/0323011","journal-title":"SIAM J.Control Optim."},{"issue":"4","key":"5019_CR15","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/18.32154","volume":"35","author":"MV Hegde","year":"1989","unstructured":"Hegde M.V., Stark W.E., and Teneketzis, D., On the Capacity of Channels with Unknown Interference, IEEE Trans. Inform. Theory, 1989, vol.\u00a035, no.\u00a04, pp.\u00a0770\u2013783. https:\/\/doi.org\/10.1109\/18.32154","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5019_CR16","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/TIT.1985.1057076","volume":"31","author":"MV Ba\u015far","year":"1985","unstructured":"Ba\u015far, T. and Wu, Y.-W., A Complete Characterization of Minimax and Maximin Encoder-Decoder Policies for Communication Channels with Incomplete Statistical Description, IEEE Trans. Inform. Theory, 1985, vol.\u00a031, no.\u00a04, pp.\u00a0482\u2013489. https:\/\/doi.org\/10.1109\/TIT.1985.1057076","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5019_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TIT.1987.1057288","volume":"33","author":"B Hughes","year":"1987","unstructured":"Hughes, B. and Narayan, P., Gaussian Arbitrarily Varying Channels, IEEE Trans. Inform. Theory, 1987, vol.\u00a033, no.\u00a02, pp.\u00a0267\u2013284. https:\/\/doi.org\/10.1109\/TIT.1987.1057288","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5019_CR18","doi-asserted-by":"publisher","unstructured":"Jose, S.T. and Kulkarni, A.A., On a Game Between a Delay-Constrained Communication System and a Finite State Jammer, in Proc. 2018 IEEE Conf. on Decision and Control (CDC\u20192018), Miami, FL, USA, Dec. 17\u201319, 2018, pp.\u00a05063\u20135068. https:\/\/doi.org\/10.1109\/CDC.2018.8618987","DOI":"10.1109\/CDC.2018.8618987"},{"issue":"5","key":"5019_CR19","doi-asserted-by":"publisher","first-page":"2842","DOI":"10.1109\/TIT.2020.2971682","volume":"66","author":"ST Jose","year":"2020","unstructured":"Jose, S.T. and Kulkarni, A.A., Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer, IEEE Trans. Inform. Theory, 2020, vol.\u00a066, no.\u00a05, pp.\u00a02842\u20132859. https:\/\/doi.org\/10.1109\/TIT.2020.2971682","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5019_CR20","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1214\/aoms\/1177705783","volume":"31","author":"D Blackwell","year":"1960","unstructured":"Blackwell, D., Breiman, L., and Thomasian, A.J., The Capacities of Certain Channel Classes under Random Coding, Ann. Math. Statist., 1960, vol.\u00a031, no.\u00a03, pp.\u00a0558\u2013567. https:\/\/doi.org\/10.1214\/aoms\/1177705783","journal-title":"Ann. Math. Statist."},{"issue":"2","key":"5019_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00533053","volume":"44","author":"R Ahlswede","year":"1978","unstructured":"Ahlswede, R., Elimination of Correlation in Random Codes for Arbitrarily Varying Channels, Z. Wahrsch. Verw. Gebiete, 1978, vol.\u00a044, no.\u00a02, pp.\u00a0159\u2013175. https:\/\/doi.org\/10.1007\/BF00533053","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"issue":"6","key":"5019_CR22","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/18.720535","volume":"44","author":"A Lapidoth","year":"1998","unstructured":"Lapidoth, A. and Narayan, P., Reliable Communication under Channel Uncertainty, IEEE Trans. Inform. Theory, 1998, vol.\u00a044, no.\u00a06, pp.\u00a02148\u20132177. https:\/\/doi.org\/10.1109\/18.720535","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5019_CR23","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover, T.M. and Thomas, J.A., Elements of Information Theory, Hoboken, NJ: Wiley, 2012, 2nd ed."},{"issue":"6","key":"5019_CR24","doi-asserted-by":"publisher","first-page":"3309","DOI":"10.1109\/TIT.2012.2186786","volume":"58","author":"V Kostina","year":"2012","unstructured":"Kostina, V. and Verd\u00fa, S., Fixed-Length Lossy Compression in the Finite Blocklength Regime, IEEE Trans. Inform. Theory, 2012, vol.\u00a058, no.\u00a06, pp.\u00a03309\u20133338. https:\/\/doi.org\/10.1109\/TIT.2012.2186786","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5019_CR25","first-page":"142","volume":"4","author":"CE Shannon","year":"1959","unstructured":"Shannon, C.E., Coding Theorems for a Discrete Source with a Fidelity Criterion, IRE Nat. Conv. Rec., 1959, Part 4, pp.\u00a0142\u2013163.","journal-title":"IRE Nat. Conv. Rec."},{"key":"5019_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., and Zambelli, G., Integer Programming, New York: Springer, 2014."},{"key":"5019_CR27","doi-asserted-by":"publisher","unstructured":"Kosut, O. and Kliewer, J., Dispersion of the Discrete Arbitrarily-Varying Channel with Limited Shared Randomness, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp. 1242\u20131246. https:\/\/doi.org\/10.1109\/ISIT.2017.8006727","DOI":"10.1109\/ISIT.2017.8006727"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021020010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946021020010","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021020010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:45:12Z","timestamp":1775011512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946021020010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["5019"],"URL":"https:\/\/doi.org\/10.1134\/s0032946021020010","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292321020017","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]},"assertion":[{"value":"20 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}