146 citations · 608 across the 54 of their papers we have counts for
63 papers
The Equivalence of Causal and Noncausal State Information on Bipartite Networks With State-Cognizant Receivers
Amos Lapidoth, Baohua Ni, Ligong Wang
State-dependent bipartite networks with state-cognizant receivers and state-informed transmitters are studied. Such networks have no nodes that both transmit and receive. Examples…
The State-Dependent Channel with a Rate-Limited Cribbing Helper
Amos Lapidoth, Yossef Steinberg
The capacity of a memoryless state-dependent channel is derived for a setting in which the encoder is provided with rate-limited assistance from a cribbing helper that observes the…
State-Dependent Channels with a Message-Cognizant Helper
Amos Lapidoth, Ligong Wang, Yiming Yan
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausa…
Message-Cognizant Assistance and Feedback for the Gaussian Channel
Amos Lapidoth, Ligong Wang, Yiming Yan
A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the enco…
State-Dependent DMC with a Causal Helper
Amos Lapidoth, Ligong Wang
A memoryless state sequence governing the behavior of a memoryless state-dependent channel is to be described causally to an encoder wishing to communicate over said channel. Given…
Guessing Based on Compressed Side Information
Robert Graczyk, Amos Lapidoth, Neri Merhav +1
A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description…