activity
20062009
most citedWriting on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels

33 citations · 88 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2009

Cooperative Relaying with State Available Non-Causally at the Relay

Abdellatif Zaidi, Shiva Prasad Kotagiri, J. Nicholas Laneman +1

We consider a three-terminal state-dependent relay channel with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wire…

cs.IT2009★ 24 cited

Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets

Abdellatif Zaidi, Shiva Prasad Kotagiri, J. Nicholas Laneman +1

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmit…

cs.IT2007

Variations on Information Embedding in Multiple Access and Broadcast Channels

ShivaPrasad Kotagiri, J. Nicholas Laneman

Information embedding (IE) is the transmission of information within a host signal subject to a distortion constraint. There are two types of embedding methods, namely irreversible…

cs.IT2007

Outage-Efficient Downlink Transmission Without Transmit Channel State Information

Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman

This paper investigates downlink transmission over a quasi-static fading Gaussian broadcast channel (BC), to model delay-sensitive applications over slowly time-varying fading chan…

cs.IT2007★ 31 cited

Cooperative Relaying with State Available at the Relay

Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman +1

We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, s…

cs.IT2007★ 33 cited

Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels

Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman

This paper studies a variant of the classical problem of ``writing on dirty paper'' in which the sum of the input and the interference, or dirt, is multiplied by a random variable…