2 citations · 4 across the 5 of their papers we have counts for
6 papers
Quantum Soft Covering with Relative Entropy Criterion
Xingyi He, S. Sandeep Pradhan
In this work, we propose a soft covering problem for fully quantum channels using relative entropy as a criterion for operator closeness. We establish covering lemmas by deriving o…
Decentralized sequential active hypothesis testing and the MAC feedback capacity
Achilleas Anastasopoulos, Sandeep Pradhan
We consider the problem of decentralized sequential active hypothesis testing (DSAHT), where two transmitting agents, each possessing a private message, are actively helping a thir…
A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels
Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan
In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtaine…
A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Noiseless Feedback
Ramji Venkataramanan, S. Sandeep Pradhan
A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the C…
A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
Ali Nazari, Sandeep Pradhan, Achilleas Anastasopoulos
In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this t…
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback
Ramji Venkataramanan, S. Sandeep Pradhan
We study the problem of computing the rate-distortion function for sources with feed-forward and the capacity for channels with feedback. The formulas (involving directed informati…