DeepAI AI Chat
Log In Sign Up

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

by   Sharu Theresa Jose, et al.
IIT Bombay

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.


page 1

page 2

page 3

page 4


A linear programming approach to the tracking of partials

A new approach to the tracking of sinusoidal chirps using linear program...

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...

A Quantum IP Predictor-Corrector Algorithm for Linear Programming

We introduce a new quantum optimization algorithm for Linear Programming...

Dynamic Programming and Linear Programming for Odds Problem

This paper discusses the odds problem, proposed by Bruss in 2000, and it...

Linear programming-based solution methods for constrained POMDPs

Constrained partially observable Markov decision processes (CPOMDPs) hav...

An Approach for Finding Permutations Quickly: Fusion and Dimension matching

Polyhedral compilers can perform complex loop optimizations that improve...

Distributed and Streaming Linear Programming in Low Dimensions

We study linear programming and general LP-type problems in several big ...