2 papers
cs.IT2013
New Non-asymptotic Random Channel Coding Theorems
En-hui Yang, Jin Meng
New non-asymptotic random coding theorems (with error probability and finite block length ) based on Gallager parity check ensemble and Shannon random code ensemble with a f…
cs.IT2011
Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources
Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of…