Related papers: Gaussian Multiple and Random Access in the Finite …
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…
In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…
We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable…
Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…
In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding,…
This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the…
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the…
We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…
The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…
Random access codes (RACs) are used by a party to despite limited communication access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study…
In this paper, we analyze the 2-relay multiple-input multiple-output (MIMO) Gaussian diamond channel. We show that a multihopping decode-and-forward with multiple access (MDF-MAC) protocol achieves rates within a constant gap from capacity…
This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…
The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…
We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…
We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type…
In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the…
We consider the problem of polar coding for transmission over $m$-user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a multi-user successive cancellation decoder is deployed…
Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…