Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding

DOI10.1109/TIT.2017.2738634zbMath1390.94234arXiv1608.03165OpenAlexW2962972025MaRDI QIDQ4566545

Ankur A. Kulkarni, Sharu Theresa Jose

Publication date: 27 June 2018

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

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

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Related Items (2)

Existence of Team-Optimal Solutions in Static Teams with Common Information: A Topology of Information Approach ⋮ Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel

This page was built for publication: Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding