English
Related papers

Related papers: Comments on "Broadcast Channels with Arbitrarily C…

200 papers

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

Information Theory · Computer Science 2010-11-01 Anas Chaaban , Aydin Sezgin

Korner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region to more than 2 receivers…

Information Theory · Computer Science 2008-01-10 Chandra Nair , Abbas El Gamal

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We consider the discrete memoryless degraded broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function.…

Information Theory · Computer Science 2015-04-23 Yasutada Oohama

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

In this paper, we consider orthogonal multiple access coding schemes, where correlated sources are encoded in a distributed fashion and transmitted, through additive white Gaussian noise (AWGN) channels, to an access point (AP). At the AP,…

Information Theory · Computer Science 2023-02-08 A. Abrardo , G. Ferrari , M. Martalo' , M. Franceschini , R. Raheli

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

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

We consider the problem of transmission of several distributed correlated sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel.…

Information Theory · Computer Science 2016-11-15 R. Rajesh , Vinod Sharma , V. K. Varshenya

This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known…

Information Theory · Computer Science 2024-01-24 Ian Zieder , Antonino Favano , Luca Barletta , Alex Dytso

Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large…

Information Theory · Computer Science 2023-06-21 Johannes Rosenberger , Abdalla Ibrahim , Christian Deppe , Roberto Ferrara

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

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 derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel…

Information Theory · Computer Science 2011-10-11 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…

Information Theory · Computer Science 2014-09-09 Mohammad Javad Emadi , Majid Nasiri Khormuji , Mikael Skoglund , Mohammad Reza Aref

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

Information Theory · Computer Science 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

The capacity region of the one-sided Gaussian interference channel is established in the weak interference regime. To characterize this region, a new representation of the Han-Kobayashi inner bound for the one-sided Gaussian interference…

Information Theory · Computer Science 2015-09-21 Mojtaba Vaezi , H. Vincent Poor