English
Related papers

Related papers: An improved rate region for the classical-quantum …

200 papers

In a premier paper on the information-theoretic analysis of a two-user cognitive interference channel(CIC), Devroye et al. presented an achievable rate region for the two-user discrete memoryless CIC. The coding scheme proposed by Devroye…

Information Theory · Computer Science 2015-09-22 Mostafa Monemizadeh

We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…

Quantum Physics · Physics 2016-05-04 Holger Boche , Ning Cai , Janis Nötzel

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

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

In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…

Quantum Physics · Physics 2019-03-11 Stephen Diadamo , Holger Boche

We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of…

Information Theory · Computer Science 2024-10-30 Michael X. Cao , Pascal O. Vontobel

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

We investigate a new class of unital quantum channels on $\mathrm{M}_{2^k}$, acting as radial multipliers when we identify the matrix algebra $\mathrm{M}_{2^k}$ with a finite-dimensional fermion algebra. Our primary contribution lies in the…

Quantum Physics · Physics 2024-12-11 Cédric Arhancet

Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access…

Information Theory · Computer Science 2025-06-11 Dina Abdelhadi , Colin Sandon , Emmanuel Abbe , Ruediger Urbanke

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…

Information Theory · Computer Science 2015-03-18 John Tadrous , Mohammed Nafie

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the Han-Kobayashi (HK) rate region for general interference channel is partially improved. The obtained partially new achievable rate region (i) is…

Information Theory · Computer Science 2010-12-30 Ghosheh Abed Hodtani

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…

Quantum Physics · Physics 2009-11-07 G. Bowen

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with $N$, the number of channel outputs that are detected jointly by the quantum joint-detection receiver…

Information Theory · Computer Science 2017-07-25 Hye Won Chung , Saikat Guha , Lizhong Zheng

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…

Information Theory · Computer Science 2014-03-24 Zeina Mheich , Florence Alberge , Pierre Duhamel

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

Transmission of classical information using quantum objects such as polarized photons is studied. The classical (Shannon) channel capacity and its relation to quantum (von Neumann) channel capacity is investigated for various receiver…

Quantum Physics · Physics 2007-05-23 Göran Einarsson

Coding for the causal cognitive radio channel, with the cognitive source subjected to a half-duplex constraint, is studied. A discrete memoryless channel model incorporating the half-duplex constraint is presented, and a new achievable rate…

Information Theory · Computer Science 2010-06-07 Debdeep Chatterjee , Tan F. Wong , Ozgur Oyman

We consider the problem of communication over a classical-quantum broadcast channel with one sender and two receivers. Generalizing the classical inner bounds shown by Marton and the recent quantum asymptotic version shown by Savov and…

Information Theory · Computer Science 2015-03-02 Jaikumar Radhakrishnan , Pranab Sen , Naqueeb Warsi

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

Information Theory · Computer Science 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen