Related papers: Deterministic Identification Over Multiple-Access …
We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive…
It is known that fiber nonlinearities induce crosstalk in a wavelength division multiplexed (WDM) system, which limits the capacity of such systems as the transmitted signal power is increased. A network user in a WDM system is an entity…
This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length…
Channel capacity plays a crucial role in the development of modern communication systems as it represents the maximum rate at which information can be reliably transmitted over a communication channel. Nevertheless, for the majority of…
We consider a cooperative two-user multiaccess channel in which the transmission is controlled by a random state. Both encoders transmit a common message and, one of the encoders also transmits an individual message. We study the capacity…
The binary adder is a two-user multiple access channel whose inputs are binary and whose output is the real sum of the inputs. While the Shannon capacity region of this channel is well known, little is known regarding its zero-error…
In this paper, we characterize the capacity region for the two-user linear Gaussian compound Multiple Access Channel with common message (MACC) and with intersymbol interference (ISI) under an input power constraint. The region is obtained…
We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously…
Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…
The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…
In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) under per-antenna peak- and average-intensity constraints. We first consider the case where the average intensities of…
Optical wireless communication (OWC) using intensity-modulation and direct-detection (IM/DD) has a channel model which possesses unique features, due to the constraints imposed on the channel input. The aim of this tutorial is to overview…
The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…
The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics…
Point-to-point permutation channels are useful models of communication networks and biological storage mechanisms and have received theoretical attention in recent years. Propelled by relevant advances in this area, we analyze the…
We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown $\tfrac{2}{3}$ secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access…
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length $n$ such that the error probability goes to zero as $n$ goes to infinity. In this definition, it is implicit that the block…
We undertake a Shannon theoretic study of the problem of communicating bit streams over a 3-user quantum interference channel (QIC) and focus on characterizing inner bounds. Adopting the powerful technique of tilting, smoothing, and…
A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for…
We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…