English
Related papers

Related papers: On Gaussian MACs with Variable-Length Feedback and…

200 papers

A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information…

Information Theory · Computer Science 2015-03-17 Uria Basher , Avihay Shirazi , Haim Permuter

We address the arbitrarily varying channel (AVC) with colored Gaussian noise. The work consists of three parts. First, we study the general discrete AVC with fixed parameters, where the channel depends on two state sequences, one arbitrary…

Information Theory · Computer Science 2020-04-20 Uzi Pereg , Yossef Steinberg

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent…

Information Theory · Computer Science 2016-11-18 Min Li , Osvaldo Simeone , Aylin Yener

In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem.…

Information Theory · Computer Science 2013-02-12 Yasutada Oohama

In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the…

Information Theory · Computer Science 2016-08-10 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

In this paper it is shown that the nonfeedback capacity of multiple-input multiple-output (MIMO) additive Gaussian noise (AGN) channels, when the noise is nonstationary and unstable, is characterized by an asymptotic optimization problem…

Information Theory · Computer Science 2022-05-04 Charalambos D. Charalambous , Stelios Louka

The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to the…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

The arbitrarily varying channel (AVC) is a conservative way of modeling an unknown interference, and the corresponding capacity results are pessimistic. We reconsider the Gaussian AVC by relaxing the classical model and thereby weakening…

Information Theory · Computer Science 2012-09-14 Anand D. Sarwate , Michael Gastpar

We consider a problem where a memoryless bi-variate Gaussian source is to be transmitted over an additive white Gaussian multiple-access channel with two transmitting terminals and one receiving terminal. The first transmitter only sees the…

Information Theory · Computer Science 2007-07-16 Amos Lapidoth , Stephan Tinguely

This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…

Quantum Physics · Physics 2015-06-18 H. Boche , J. Noetzel

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti

Feedback is shown to increase the sum-rate capacity of K-user Gaussian multiple-access channels by at most a factor of approximately 1.54, improving Thomas' doubling bound (1987). The new bound is the best possible in the sense that it can…

Information Theory · Computer Science 2021-08-24 Gerhard Kramer

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…

Information Theory · Computer Science 2016-11-18 Daniela Tuninetti

We propose a new coding scheme for the discrete memoryless two-user multi-access channel (MAC) with rate-limited feedback. Our scheme combines ideas from the Venkataramanan-Pradhan scheme for perfect feedback with ideas from the…

Information Theory · Computer Science 2015-03-12 Selma Belhadj Amor

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref