Unifying information theory and digital communication through the language of lattice codes,
this book provides a detailed overview for students, researchers and industry practitioners. It …

In this survey we review the concepts and methods of communication systems equipped
with side information. We focus on the channel coding problem, where side information is …

In this correspondence, we identify the common underlying form of the capacity expression
that is applicable to both cases where causal or noncausal side information is made …

This correspondence gives an achievable rate equivocation region for the discrete
memoryless wiretap channel with side information. We extend our results to the Gaussian …

In Costa's dirty-paper channel, Gaussian random binning is able to eliminate the effect of
interference which is known at the transmitter, and thus achieve capacity. We examine a …

In this work, coding for the degraded broadcast channel controlled by random parameters is
studied. Two main paradigms are considered: where side information on the random …

We generalize the Gel'fand–Pinsker model to encompass the setup of a memoryless
multiple-access channel (MAC). According to this setup, only one of the encoders knows the …

Lattice codes are known to achieve capacity in the Gaussian point-to-point channel,
achieving the same rates as iid random Gaussian codebooks. Lattice codes are also known …

In this paper we study coding for the general broadcast channel, controlled by random
parameters, where the parameters are provided to the encoder only, in a non-causal …

We consider a state-dependent multiaccess channel (MAC) with state noncausally known to
some encoders. For simplicity of exposition, we focus on a two-encoder model in which one …