English
Related papers

Related papers: Multiple Access Channels with Combined Cooperation…

200 papers

Relay-assisted cooperative wireless communication has been shown to have significant performance gains over the legacy direct transmission scheme. Compared with single relay based cooperation schemes, utilizing multiple relays further…

Networking and Internet Architecture · Computer Science 2015-03-19 Pei Liu , Chun Nie , Thanasis Korakis , Elza Erkip , Shivendra Panwar , Francesco Verde , Anna Scaglione

This work considers reliable transmission of general correlated sources over the multiple-access relay channel (MARC) and the multiple-access broadcast relay channel (MABRC). In MARCs only the destination is interested in a reconstruction…

Information Theory · Computer Science 2012-07-02 Yonathan Murin , Ron Dabora , Deniz Gündüz

We show that for the multi-antenna Gaussian multi-access channel (MAC) and broadcast channel (BC) with perfect feedback, the rate regions achieved by linear-feedback coding schemes (called linear-feedback capacity regions) coincide when the…

Information Theory · Computer Science 2014-04-10 Selma Belhadj Amor , Yossef Steinberg , Michèle Wigger

In a cooperative coding scheme, network nodes work together to achieve higher transmission rates. To obtain a better understanding of cooperation, we consider a model in which two transmitters send rate-limited descriptions of their…

Information Theory · Computer Science 2015-04-20 Parham Noorzad , Michelle Effros , Michael Langberg

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Pablo Piantanida , Shlomo Shamai

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (cq-MAC), achievable rates are known assuming that all the messages are decoded, a…

Quantum Physics · Physics 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

In this paper we present a cooperative medium access control (MAC) protocol that is designed for a physical layer that can decode interfering transmissions in distributed wireless networks. The proposed protocol pro-actively enforces two…

Networking and Internet Architecture · Computer Science 2012-01-09 Antonios Argyriou

We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to the simpler problem of code construction for source resolvability. Specifically, we propose a MAC resolvability code…

Information Theory · Computer Science 2022-03-03 Rumia Sultana , Remi A. Chou

A fundamental problem in decentralized networked systems is to coordinate actions of different agents so that they reach a state of agreement. In such applications, it is additionally desirable that the actions at various nodes may not be…

Information Theory · Computer Science 2024-11-22 Viswanathan Ramachandran , Tobias J. Oechtering , Mikael Skoglund

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

The capacity of a channel characterizes the maximum rate at which information can be transmitted through the channel asymptotically faithfully. For a channel with multiple senders and a single receiver, computing its sum capacity is…

Information Theory · Computer Science 2023-08-31 Akshay Seshadri , Felix Leditzky , Vikesh Siddhu , Graeme Smith

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

Consider the \emph{simultaneous relay channel} (SRC) which consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to…

Information Theory · Computer Science 2015-03-19 Arash Behboodi , Pablo Piantanida

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…

Information Theory · Computer Science 2012-12-19 Mostafa Monemizadeh , Saeed Hajizadeh , Seyed Alireza Seyedin , Ghosheh Abed Hodtani

We present a general rate duality between the multiple access channel (MAC) and the broadcast channel (BC) which is applicable to systems with and without nonlinear interference cancellation. Different to the state-of-the-art rate duality…

Information Theory · Computer Science 2016-11-15 Raphael Hunger , Michael Joham

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

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…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

A hybrid communication network with a common analog signal and an independent digital data stream as input to each node in a multiple access network is considered. The receiver/base-station has to estimate the analog signal with a given…

Information Theory · Computer Science 2018-11-27 Viswanathan Ramachandran , Sibi Raj B Pillai , Vinod M Prabhakaran