Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming is a scholarly work, published in 2019 in ''IEEE Transactions on Information Theory''. The main subjects of the publication include cellular automaton, point, coding, lossless compression, converse, algorithm, linear programming, discrete mathematics, mathematics, and computer science. 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.