Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
From MaRDI portal
Publication:2044125
DOI10.1134/S0032946021020010zbMath1469.94005arXiv1907.05324OpenAlexW3180730375MaRDI QIDQ2044125
Publication date: 4 August 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05324
Stochastic games, stochastic differential games (91A15) Communication theory (94A05) Source coding (94A29)
Cites Work
- An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures
- Lossy Joint Source-Channel Coding in the Finite Blocklength Regime
- Integer Programming
- A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description
- Some Information Theoretic Saddlepoints
- Gaussian arbitrarily varying channels
- Elimination of correlation in random codes for arbitrarily varying channels
- Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding
- Reliable communication under channel uncertainty
- On the capacity of channels with unknown interference
- Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer
- Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
- Fixed-Length Lossy Compression in the Finite Blocklength Regime
- Channel Coding Rate in the Finite Blocklength Regime
- Game Theory
- Elements of Information Theory
- A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity
- The Capacities of Certain Channel Classes Under Random Coding
- Information Theory
This page was built for publication: Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
