Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
From MaRDI portal
Publication:5223940
DOI10.1109/TIT.2018.2873623zbMATH Open1431.94059arXiv1801.08693OpenAlexW2963138763WikidataQ129131587 ScholiaQ129131587MaRDI QIDQ5223940FDOQ5223940
Authors: Sharu Theresa Jose, Ankur A. Kulkarni 
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength metaconverses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.
Full work available at URL: https://arxiv.org/abs/1801.08693
Cited In (1)
This page was built for publication: Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223940)
