English
Related papers

Related papers: Signal Shaping for Two-User Gaussian Multiple Acce…

200 papers

A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with…

Information Theory · Computer Science 2018-04-17 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

This letter proposes a novel random medium access control (MAC) based on a transmission opportunity prediction, which can be measured in a form of a conditional success probability given transmitter-side interference. A transmission…

Networking and Internet Architecture · Computer Science 2019-12-16 Jinho Choi , Seung-Woo Ko , Koji Yamamoto , Seong-Lyun Kim

We propose a covert communication protocol for the spread-spectrum multiple random access with additive white Gaussian noise (AWGN) channel. No existing paper has studied covert communication for the random access channel. Our protocol…

Information Theory · Computer Science 2023-10-25 Masahito Hayashi , Angeles Vazquez-Castro

We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…

Information Theory · Computer Science 2025-06-04 Xiaoqi Liu , Kuan Hsieh , Ramji Venkataramanan

In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…

Information Theory · Computer Science 2012-12-17 Saeed Hajizadeh , Ghosheh Abed Hodtani

The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is…

Information Theory · Computer Science 2016-11-17 Anatoly Khina , Idan Livni , Ayal Hitron , Uri Erez

In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work…

Information Theory · Computer Science 2014-10-03 Alex Dytso , Daniela Tuninetti , Natasha Devroye

The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Haim H. Permuter

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

We consider the problem of transmitting a bivariate Gaussian source over a two-user additive Gaussian multiple-access channel with feedback. Each of the transmitters observes one of the source components and tries to describe it to the…

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

We first investigate two-user nonasymmetric sum-rate Poisson capacity with non-perfect photoncounting receiver under certain condition and demonstrate three possible transmission strategy, including only one active user and both active…

Information Theory · Computer Science 2021-06-10 Zhimeng Jiang , Chen Gong , Guanchu Wang , Zhengyuan Xu

In this paper, we present a framework for distributively optimizing the transmission strategies of secondary users in an ad hoc cognitive radio network. In particular, the proposed approach allows secondary users to set their transmit…

Networking and Internet Architecture · Computer Science 2016-02-05 Orestis Georgiou , Mohammud Z. Bocus , Shanshan Wang

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

With no CSI at the users, transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the input, is not efficient because error rates will be high when the channel conditions are poor. However,…

Information Theory · Computer Science 2012-01-17 Sudipta Kundu , B. Sundar Rajan

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

Information Theory · Computer Science 2010-07-12 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We consider the two-receiver memoryless broadcast channel with states where each receiver requests both common and private messages, and may know part of the private message requested by the other receiver as receiver message side…

Information Theory · Computer Science 2016-11-17 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

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 investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

The construction of optimal non-uniform mappings for discrete input memoryless channels (DIMCs) is investigated. An efficient algorithm to find optimal mappings is proposed and the rate by which a target distribution is approached is…

Information Theory · Computer Science 2014-07-09 Georg Böcherer