2 citations · 4 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2008★ 2 cited
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…
cs.IT2007★ 2 cited
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…