Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming

DOI10.1109/TIT.2018.2873623zbMath1431.94059arXiv1801.08693OpenAlexW2963138763WikidataQ129131587 ScholiaQ129131587MaRDI QIDQ5223940

Ankur A. Kulkarni, Sharu Theresa Jose

Publication date: 19 July 2019

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

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

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Source coding (94A29)

Related Items (1)

Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel

This page was built for publication: Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming