The following publications are possibly variants of this publication:
- Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear ProgrammingSharu Theresa Jose, Ankur A. Kulkarni. TIT, 65(4):2423-2441, 2019. [doi]
- Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying ChannelAnuj S. Vora, Ankur A. Kulkarni. poit, 57(2):99-128, 2021. [doi]
- Linear Programming Based Finite Blocklength Converses in Information TheoryAnkur A. Kulkarni, Sharu Theresa Jose. ita 2018: 1-10 [doi]
- Linear programming based finite blocklength converses for some network-like problemsSharu Theresa Jose, Ankur A. Kulkarni. itw 2017: 544-548 [doi]
- New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear ProgrammingSharu Theresa Jose, Ankur A. Kulkarni. spcom 2018: 447-451 [doi]
- A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVCAnuj Vora, Ankur Kulkarni. ncc 2019: 1-6 [doi]