Related papers: Coset codes for communicating over non-additive ch…
In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…
Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…
In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels.…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, which are building blocks for the code construction, are used in the construction of…
The problem of computing sum of sources over a multiple access channel (MAC) is considered. Building on the technique of linear computation coding (LCC) proposed by Nazer and Gastpar [2007], we employ the ensemble of nested coset codes to…
Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…
This paper is a first study on the topic of achieving physical layer security by exploiting non-systematic channel codes. The chance of implementing transmission security at the physical layer is known since many years in information…
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that…
This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier studies, as the coding…
In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate…
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…
The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…
To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…
Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…
The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…
We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…
Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that…