Approximate minimax theorems are shown for the finite blocklength lossy JSCC game over an AVC, with minimax and maximin values coinciding asymptotically and at second order around a critical rate threshold.
Reliable communication un der channel uncertainty,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC
Approximate minimax theorems are shown for the finite blocklength lossy JSCC game over an AVC, with minimax and maximin values coinciding asymptotically and at second order around a critical rate threshold.