Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer

DOI10.1109/TIT.2020.2971682zbMath1448.94131arXiv1811.07358OpenAlexW3005517392MaRDI QIDQ5123898

Sharu Theresa Jose, Ankur A. Kulkarni

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.07358

zbMATH Keywords

zero-sum gamechannel codingadversarial jammerfinite blocklength encoder-decoder team

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (2)

Zero-sum games involving teams against teams: existence of equilibria, and comparison and regularity in information ⋮ Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel

This page was built for publication: Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer