English
Related papers

Related papers: Interference channel capacity region for randomize…

200 papers

Deterministic identification (DI) has emerged as a promising paradigm for large-scale and goal-oriented communication systems. Despite significant progress, a fundamental open problem has remained unresolved: a persistent gap between the…

Information Theory · Computer Science 2026-04-14 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a variant of the cognitive interference channel (CIFC) where the cognitive (secondary) destination not only decodes the information sent from its…

Information Theory · Computer Science 2011-02-21 Hsuan-Yi Chu , Hsuan-Jung Su

In this paper, we characterize the capacity region for the two-user linear Gaussian compound Multiple Access Channel with common message (MACC) and with intersymbol interference (ISI) under an input power constraint. The region is obtained…

Information Theory · Computer Science 2012-12-19 Mostafa Monemizadeh , Saeed Hajizadeh , Seyed Alireza Seyedin , Ghosheh Abed Hodtani

Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to…

Information Theory · Computer Science 2015-05-05 Radha Krishna Ganti , Andrew Thangaraj , Arijit Mondal

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…

Information Theory · Computer Science 2008-10-15 Nan Liu , Deniz Gunduz , Andrea J. Goldsmith , H. Vincent Poor

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem.…

Information Theory · Computer Science 2013-02-12 Yasutada Oohama

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Abbas El Gamal

This paper considers a variation of the classical two-user interference channel where the communication of two interfering source-destination pairs is aided by an additional node that has a priori knowledge of the messages to be…

Information Theory · Computer Science 2014-09-09 Alex Dytso , Stefano Rini , Natasha Devroye , Daniela Tuninetti

We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…

Information Theory · Computer Science 2016-02-18 F. Shirani , S. S. Pradhan

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value,…

Information Theory · Computer Science 2009-09-29 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each receiver's ID rate does not exceed the mutual information…

Information Theory · Computer Science 2017-06-02 Annina Bracher , Amos Lapidoth

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

We consider the compound memoryless quantum multiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be…

Quantum Physics · Physics 2019-06-25 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

Information Theory · Computer Science 2017-12-08 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

Information Theory · Computer Science 2017-04-20 Junyoung Nam

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

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with…

Information Theory · Computer Science 2016-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

We develop practical coding schemes for the cognitive overlay radios as modeled by the cognitive interference channel, a variation of the classical two user interference channel where one of the transmitters has knowledge of both messages.…

Information Theory · Computer Science 2012-06-12 Ernest Kurniawan , Andrea Goldsmith , Stefano Rini
‹ Prev 1 4 5 6 7 8 10 Next ›