Related papers: The Strongly Asynchronous Massive Access Channel
We investigate the asynchronous multiple user access communication in optical wireless scattering communication, where different users transmit signals without perfect alignment in the time domain. Firstly, we characterize the received…
We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…
This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…
A sender wishes to broadcast a message of length $n$ over an alphabet to $r$ users, where each user $i$, $1 \leq i \leq r$ should be able to receive one of $m_i$ possible messages. The broadcast channel has noise for each of the users…
The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing and adaptive transmission (MS-AT) is proposed. Under the framework of…
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 consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength $n$. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the…
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…
This paper has been withdrawn because of some paper issues. Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) can be controlled to be achieve optimality in terms of throughput or utility. These results…
The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…
Future wireless access networks aim to simultaneously support a large number of devices with heterogeneous service requirements, including data rates, error rates, and latencies. While achievable rate and capacity results exist for Gaussian…
The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…
As 6G networks demand massive connectivity and stronger interference control, rate-splitting multiple access (RSMA) is attractive because it superposes a common stream and user-private streams and remains effective under imperfect CSIT and…
This work explores a multiple transmit antenna setting in a multi-access coded caching (MACC) network where each user accesses more than one cache. A MACC network has $K$ users and $K$ caches, and each user has access to $r < K$ consecutive…
The theoretical analysis of downlink massive MIMO usually assumes the ideal Gaussian channel matrix with asymp- totic orthogonality of channel vectors associated with different users, since it can provide the favorable propagation…
In this work we extend the recently proposed synchronous broadcast algorithm amnesiac flooding to the case of intermittent communication channels. In amnesiac flooding a node forwards a received message in the subsequent round. There are…
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower…
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…
In this paper, the fundamental limits of decentralized simultaneous information and energy transmission in the $K$-user Gaussian multiple access channel (G-MAC), with an arbitrary $K \geqslant 2$ and one non-colocated energy harvester (EH),…
We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…