Related papers: Playing Games with Multiple Access Channels
Wireless communications at the chip scale emerge as a interesting complement to traditional wire-based approaches thanks to their low latency, inherent broadcast nature, and capacity to bypass pin constraints. However, as current trends…
In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…
The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast messages is studied in which one common message is to be multicast to all receivers and the second private message to a subset of receivers. The receivers…
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In…
The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the…
We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to…
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The…
This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and…
The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…
Communication over a quantum multiple access channel (MAC) is considered with classical feedback. Since the no-cloning prohibits universal copying of arbitrary quantum states, classical feedback is generated through measurement. An…
Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…
In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access…
Entanglement-assisted classical communication and transmission of a quantum system are the two quantum resources for information processing. Many information tasks can be performed using either quantum resource. However, this equivalence is…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…
We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…
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…
The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…