English
Related papers

Related papers: The Gaussian MAC with Conferencing Encoders

200 papers

The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders'…

Information Theory · Computer Science 2010-07-23 Shraga I. Bross , Amos Lapidoth

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

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…

Information Theory · Computer Science 2021-06-18 Lorenzo Miretti , Mari Kobayashi , David Gesbert , Paul de Kerret

Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a…

This paper considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturbance constraint at the unintended/secondary receiver. The…

Information Theory · Computer Science 2016-03-25 Alex Dytso , Ronit Bustin , Daniela Tuninetti , Natasha Devroye , H. Vincent Poor , Shlomo Shamai

This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…

Information Theory · Computer Science 2014-10-21 Meryem Benammar , Pablo Piantanida , Shlomo Shamai

We study the power versus distortion trade-off for the distributed transmission of a memoryless bi-variate Gaussian source over a two-to-one average-power limited Gaussian multiple-access channel. In this problem, each of two separate…

Information Theory · Computer Science 2016-11-17 Amos Lapidoth , Stephan Tinguely

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…

Information Theory · Computer Science 2015-03-20 Ahmad Abu Al Haija , Mai Vu

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

Multi-user Gaussian MIMO wiretap channel is considered under interference power constraints (IPC), in addition to the total transmit power constraint (TPC). Algorithms for \textit{global} maximization of its secrecy rate are proposed. Their…

Information Theory · Computer Science 2020-12-02 Limeng Dong , Sergey Loyka , Yong Li

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

We prove the strong converse for the $N$-source Gaussian multiple access channel (MAC). In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability less than one must lie…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

Information Theory · Computer Science 2019-10-01 Lan V. Truong , Hirosuke Yamamoto

We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is…

Information Theory · Computer Science 2007-11-21 Abolfazl S. Motahari , Amir K. Khandani

This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…

Information Theory · Computer Science 2018-11-09 Christian Lameiro , Ignacio Santamaria , Peter J. Schreier

An interference channel is said to have strong interference if for all input distributions, the receivers can fully decode the interference. This definition of strong interference applies to discrete memoryless, scalar and vector Gaussian…

Information Theory · Computer Science 2016-11-17 Xiaohu Shang , H. Vincent Poor

This paper explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters. The central contributions are an inner and outer bound on the…

Quantum Physics · Physics 2025-01-24 Jonas Hawellek , Athin Mohan , Hadi Aghaee , Christian Deppe

Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding…

Information Theory · Computer Science 2011-11-09 Bernd Bandemer , Abbas El Gamal

In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne…

Quantum Physics · Physics 2023-07-25 A. S. Holevo , S. N. Filippov
‹ Prev 1 8 9 10 Next ›