English
Related papers

Related papers: Perfect vs. Independent Feedback in the Multiple-A…

200 papers

In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users' input…

Information Theory · Computer Science 2008-03-27 Ali Nazari , Sandeep Pradhan , Achilleas Anastasopoulos

We study the network spectral efficiency of decentralized vector multiple access channels (MACs) when the number of accessible dimensions per transmitter is strategically limited. Considering each dimension as a frequency band, we call this…

Information Theory · Computer Science 2009-05-19 Samir M. Perlaza , Merouane Debbah , Samson Lasaulce , Hanna Bogucka

In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability…

Information Theory · Computer Science 2019-05-14 Mohsen Heidari , S. Sandeep Pradhan

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with…

Information Theory · Computer Science 2017-09-05 Changho Suh , Jaewoong Cho , David Tse

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

Information Theory · Computer Science 2023-09-12 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at the receivers via downlink training and it is provided to the transmitter by channel state feedback. Unquantized…

Information Theory · Computer Science 2016-11-17 Giuseppe Caire , Nihar Jindal , Mari Kobayashi , Niranjay Ravindran

We determine the capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels. In contrast with the Rayleigh and uncorrelated Rician cases, no closed-form expressions for the eigenvectors of the…

Information Theory · Computer Science 2007-07-13 Julien Dumont , Philippe Loubaton , Samson Lasaulce

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that…

Information Theory · Computer Science 2016-11-17 Marios Kountouris , Jeffrey G. Andrews

Large language models improve with scale, yet feedback-based alignment still exhibits systematic deviations from intended behavior. Motivated by bounded rationality in economics and cognitive science, we view judgment as resource-limited…

Machine Learning · Computer Science 2025-09-22 Wenjun Cao

A conflict-avoiding code (CAC) of length L and weight w is used for deterministic multiple-access without feedback. When the number of simultaneous active users is less than or equal to w, such a code is able to provide a hard guarantee…

Information Theory · Computer Science 2026-04-20 Tsai-Lien Wong , Kangkang Xu , Yuan-Hsun Lo , Kenneth W. Shum , Yijin Zhang

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

The capacity region of the N-sender Gaussian multiple access channel with feedback is not known in general. This paper studies the class of linear-feedback codes that includes (nonlinear) nonfeedback codes at one extreme and the…

Information Theory · Computer Science 2011-06-06 Ehsan Ardestanizadeh , Michele A. Wigger , Young-Han Kim , Tara Javidi

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the…

Information Theory · Computer Science 2014-11-11 Michael Heindlmaier , Navid Reyhanian , Shirin Saeedi Bidokhti

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…

Information Theory · Computer Science 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji

In this paper, we study the effect of channel output feedback on the sum capacity in a two-user symmetric deterministic interference channel. We find that having a single feedback link from one of the receivers to its own transmitter…

Information Theory · Computer Science 2009-08-31 Achaleshwar Sahai , Vaneet Aggarwal , Melda Yuksel , Ashutosh Sabharwal

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

A network consisting of a point-to-point (P2P) link and a multiple access channel (MAC) sharing the same medium is considered. The resulting interference network, with three transmitters and two receivers is studied from degrees of freedom…

Information Theory · Computer Science 2011-10-05 Anas Chaaban , Aydin Sezgin

Gaussian MIMO channel under total transmit and multiple interference power constraints (TPC and IPCs) is considered. A closed-form solution for its optimal transmit covariance matrix is obtained in the general case (up to dual variables). A…

Information Theory · Computer Science 2020-05-18 Sergey Loyka

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via…

Information Theory · Computer Science 2016-03-24 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini