English
Related papers

Related papers: A New Coding Scheme for Discrete Memoryless MACs w…

200 papers

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

We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility function of transmission rates over the throughput capacity…

Information Theory · Computer Science 2008-10-08 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard

We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

Information Theory · Computer Science 2016-11-18 Jian Cao , Edmund M. Yeh

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the Han-Kobayashi (HK) rate region for general interference channel is partially improved. The obtained partially new achievable rate region (i) is…

Information Theory · Computer Science 2010-12-30 Ghosheh Abed Hodtani

In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…

Information Theory · Computer Science 2025-05-06 Zhentian Zhang , Mohammad Javad Ahmadi , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order $L$, we derive two new results for the feedback capacity under an average channel input power constraint. First, we show that a very…

Information Theory · Computer Science 2007-07-13 Shaohua Yang , Aleksandar Kavcic , Sekhar Tatikonda

We consider the problem of communication over a three user discrete memoryless interference channel ($3-$IC). The current known coding techniques for communicating over an arbitrary $3-$IC are based on message splitting, superposition…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Aria G. Sahebi , S. Sandeep Pradhan

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

This paper investigates the achievable region of a $K$-user discrete memoryless (DM) multiple access wiretap (MAC-WT) channel, where each user transmits both secret and open messages. All these messages are intended for Bob, while Eve is…

Information Theory · Computer Science 2024-07-03 Hao Xu , Kai-Kit Wong , Giuseppe Caire

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

To enhance the multiplexing gain of two-receiver Multiple-Input-Single-Output Broadcast Channel with imperfect channel state information at the transmitter (CSIT), a class of Rate-Splitting (RS) approaches has been proposed recently, which…

Information Theory · Computer Science 2015-07-01 Chenxi Hao , Yueping Wu , Bruno Clerckx

The Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the point-to-point white Gaussian channel with feedback, is secure by itself and also achieves the secrecy capacity of the Gaussian wiretap channel with feedback, i.e., the…

Information Theory · Computer Science 2021-11-19 Bin Dai , Chong Li , Yingbin Liang , Zheng Ma , Shlomo Shamai

This paper proposes a coding framework for capacity-region-achieving sparse regression (SR) codes over MIMO multiple-access channels (MIMO-MAC), where a single SR code is used for each user at the transmitter. With random semi-unitary…

Information Theory · Computer Science 2026-04-14 Hao Yan , Lei Liu , Yuhao Liu , Burak Çakmak , Giuseppe Caire

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: i) each user wishes to communicate an independent message to the common…

Information Theory · Computer Science 2017-05-05 Wei Yang , Yingbin Liang , Shlomo Shamai , H. Vincent Poor

Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling…

Information Theory · Computer Science 2016-11-15 Mohammad Shaqfeh , Hussein Alnuweiri , Mohamed-Slim Alouini

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…

Information Theory · Computer Science 2018-03-23 Luiza Medova , Anton Glebov , Pavel Rybin , Alexey Frolov

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new…

Information Theory · Computer Science 2012-05-08 Alireza Vahid , Changho Suh , Amir Salman Avestimehr

Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme for enabling massive connectivity in next generation wireless networks. However, current SCMA codebooks are designed with the same size, leading to…

Information Theory · Computer Science 2024-11-14 Qu Luo , Pei Xiao , Gaojie Chen , Jing Zhu

We study the power-versus-distortion trade-off for the transmission of a memoryless bivariate Gaussian source over a two-to-one Gaussian multiple-access channel with perfect causal feedback. In this problem, each of two separate…

Information Theory · Computer Science 2009-03-23 Amos Lapidoth , Stephan Tinguely