English
Related papers

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

200 papers

While interference alignment schemes have been employed to realize the full multiplexing gain of $K$-user interference channels, the analyses performed so far have predominantly focused on the case when global channel knowledge is available…

Information Theory · Computer Science 2009-12-01 Rajesh T Krishnamachari , Mahesh K Varanasi

The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity…

Quantum Physics · Physics 2009-11-11 Brent J. Yen , Jeffrey H. Shapiro

In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Jean-Marie Gorce

In this paper, an achievable error exponent for the multiple-access channel with two independent sources is derived. For each user, the source messages are partitioned into two classes and codebooks are generated by drawing codewords from…

Information Theory · Computer Science 2018-09-06 Arezou Rezazadeh , Josep Font-Segura , Alfonso Martinez , Albert Guillén i Fàbregas

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources,…

Information Theory · Computer Science 2016-11-17 Yonathan Murin , Ron Dabora , Deniz Gündüz

We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…

Information Theory · Computer Science 2025-04-28 Matthias Frey , Igor Bjelaković , Michael C. Gastpar , Jingge Zhu

The capacity of a channel characterizes the maximum rate at which information can be transmitted through the channel asymptotically faithfully. For a channel with multiple senders and a single receiver, computing its sum capacity is…

Information Theory · Computer Science 2023-08-31 Akshay Seshadri , Felix Leditzky , Vikesh Siddhu , Graeme Smith

The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the…

Information Theory · Computer Science 2015-03-19 Stefano Riniy , Daniela Tuninetti , Natasha Devroye , Andrea Goldsmith

The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed…

Information Theory · Computer Science 2016-11-17 Krishnan Eswaran , Anand D. Sarwate , Anant Sahai , Michael Gastpar

We study two kinds of different problems. One is the multiple independence testing, which can be considered as a kind of generalization of quantum Stein's lemma. We test whether the quantum system is correlated to the classical system or is…

Quantum Physics · Physics 2025-08-05 Ayanava Dasgupta , Naqueeb Ahmad Warsi , Masahito Hayashi

We propose a new inner bound on the capacity region of a memoryless multiple-access channel that is governed by a memoryless state that is known strictly causally to the encoders. The new inner bound contains the previous bounds, and we…

Information Theory · Computer Science 2011-06-03 Amos Lapidoth , Yossef Steinberg

In this paper, we investigate achievable rates on the multiple access channel with feedback and correlated sources (MACFCS). The motivation for studying the MACFCS stems from the fact that in a sensor network, sensors collect and transmit…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

Data-driven deep learning based code designs, including low-complexity neural decoders for existing codes, or end-to-end trainable auto-encoders have exhibited impressive results, particularly in scenarios for which we do not have…

Information Theory · Computer Science 2023-06-02 Emre Ozfatura , Chenghong Bian , Deniz Gunduz

In this paper, we analyze the asymptotic performance of multiple antenna channels where the transmitter has either perfect or finite bit channel state information. Using the diversity-multiplexing tradeoff to characterize the system…

Information Theory · Computer Science 2007-07-13 Ahmad Khoshnevis , Ashutosh Sabharwal

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…

Quantum Physics · Physics 2009-11-10 Dennis Kretschmann , Reinhard F Werner

The theoretic capacity of a communication system constituted of several transmitting/receiving elements is determined by the singular values of its transfer matrix. Results based on an independent identically distributed channel model,…

Mathematical Physics · Physics 2012-09-27 François Bentosela , Eric Soccorsi

The channel capacity of near-field (NF) communications is characterized by considering three types of line-of-sight multiuser channels: i) multiple access channel (MAC), ii) broadcast channel (BC), and iii) multicast channel (MC). For NF…

Information Theory · Computer Science 2024-10-29 Boqun Zhao , Chongjun Ouyang , Xingqi Zhang , Yuanwei Liu

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver.…

Information Theory · Computer Science 2025-12-03 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang
‹ Prev 1 3 4 5 6 7 10 Next ›