Paper Info
Title
Linear Programming Based Finite Blocklength Converses in Information Theory
Abstract
A linear programming based framework is presented to derive finite blocklength converses for coding problems in information theory which is also extendable to network settings. In the point-to-point setting, the LP based framework recovers and in fact improves on almost all well-known finite blocklength converses for lossy joint source-channel coding, lossy source coding and channel coding. Moreover, the LP based framework is shown to be asymptotically tight for the averaged and compound channels under the maximum probability of error criterion. Further, for multiterminal Slepian-Wolf source coding problem, a systematic approach to synthesize new converses from considering point-to-point lossless source coding (with side-information at decoder) sub-problems is introduced. The method derives new finite blocklength converse for Slepian- Wolf coding which significantly improves on the converse of Miyake and Kanaya.
Year
DOI
Venue
2018
10.1109/ITA.2018.8502953
2018 Information Theory and Applications Workshop (ITA)
Keywords
Field
DocType
finite blocklength converse,information theory,linear programming based framework,coding problems,point-to-point setting,LP based framework recovers,lossy joint source-channel coding,multiterminal Slepian-Wolf source coding problem,point-to-point lossless source coding
Information theory,Discrete mathematics,Converse,Lossy compression,Computer science,Source code,Algorithm,Communication channel,Coding (social sciences),Probability distribution,Linear programming
Conference
ISBN
Citations 
PageRank 
978-1-7281-1995-3
0
0.34
References 
Authors
2
2
Name
Order
Citations
PageRank
Ankur A. Kulkarni110620.95
Sharu Theresa Jose222.53