English
Related papers

Related papers: Latent Capacity Region: A Case Study on Symmetric …

200 papers

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In…

Information Theory · Computer Science 2015-01-06 Lóránt Farkas , Tamás Kói

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is…

Information Theory · Computer Science 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the…

Information Theory · Computer Science 2015-09-16 Hyeji Kim , Abbas El Gamal

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

We consider the problem of communicating over the general discrete memoryless broadcast channel (BC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite…

Information Theory · Computer Science 2016-11-17 Ron Dabora , Sergio D. Servetto

We derive universal codes for transmission of broadcast and confidential messages over classical-quantum-quantum and fully quantum channels. These codes are robust to channel uncertainties considered in the compound model. To construct…

Quantum Physics · Physics 2020-05-20 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…

Information Theory · Computer Science 2012-01-20 Nevroz Şen , Fady Alajaji , Serdar Yüksel , Giacomo Como

In this paper we analyze the capacity of a general model for arbitrarily varying classical-quantum channels (AVCQCs) when the sender and the receiver use correlation as a resource. In this general model, a jammer has side information about…

Information Theory · Computer Science 2020-06-11 Holger Boche , Minglai Cai , Ning Cai

We study communication with consensus over a broadcast channel - the receivers reliably decode the sender's message when the sender is honest, and their decoder outputs agree even if the sender acts maliciously. We characterize the…

Information Theory · Computer Science 2025-03-27 Neha Sangwan , Varun Narayanan , Vinod M. Prabhakaran

The cognitive radio channel with common message (CRCC) is considered. In this channel, similar to the cognitive radio channel (CRC), we have a cognitive user which has full non-causal knowledge of the primary message, and like the…

Information Theory · Computer Science 2011-08-12 Mostafa Monemizadeh , Ghosheh Abed Hodtani , Hamed Fehri

Recent research indicates that packet transmission employing random linear network coding can be regarded as transmitting subspaces over a linear operator channel (LOC). In this paper we propose the framework of linear operator broadcast…

Information Theory · Computer Science 2011-05-17 Yimin Pang , Thomas Honold

Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a…

Information Theory · Computer Science 2012-07-10 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…

Information Theory · Computer Science 2010-12-10 Giacomo Como , Serdar Yüksel

We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can…

Information Theory · Computer Science 2020-10-02 Farzin Salek , Anurag Anshu , Min-Hsiu Hsieh , Rahul Jain , Javier R. Fonollosa

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We…

Information Theory · Computer Science 2016-11-15 Chih-Chun Wang

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

We consider the discrete memoryless asymmetric 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…

Information Theory · Computer Science 2020-08-11 Yasutada Oohama

A communication setup is considered where a transmitter wishes to convey a message to a receiver and simultaneously estimates the state of that receiver through a common waveform. The state is estimated at the transmitter by means of…

Information Theory · Computer Science 2022-06-03 Mehrasa Ahmadipour , Mari Kobayashi , Miche`le Wigger , Giuseppe Caire

Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity…

Information Theory · Computer Science 2009-04-29 Chandra Nair

The capacity of wireless networks is a classic and important topic of study. Informally, the capacity of a network is simply the total amount of information which it can transfer. In the context of models of wireless radio networks, this…

Computer Science and Game Theory · Computer Science 2019-09-16 Michael Dinitz , Naomi Ephraim