English
Related papers

Related papers: Zero-Error Feedback Capacity for Bounded Stabiliza…

200 papers

The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…

Information Theory · Computer Science 2008-06-09 Hamid Farmanbar , Amir K. Khandani

In this paper, we present a condition for the zero-error capacity of quantum channels. To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed…

Quantum Physics · Physics 2023-12-22 Marciel M. Oliveira , Francisco M. de Assis , Micael A. Dias

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in…

Information Theory · Computer Science 2013-07-30 Ilia Levi , Dan Vilenchik , Michael Langberg , Michelle Effros

We study the problem of generating an approximately i.i.d. string at the output of a discrete memoryless channel using a limited amount of randomness at its input in presence of causal noiseless feedback. Feedback does not decrease the…

Information Theory · Computer Science 2016-09-29 Mani Bastani Parizi , Emre Telatar

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and…

Information Theory · Computer Science 2013-09-24 Haim H. Permuter , Himanshu Asnani , Tsachy Weissman

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a…

Quantum Physics · Physics 2026-02-10 Ambuj , Anushko Chattopadhyay , Kunika Agarwal , Rakesh Das , Amit Mukherjee

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

Quantum Physics · Physics 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

As a class of state-dependent channels, Markov channels have been long studied in information theory for characterizing the feedback capacity and error exponent. This paper studies a more general variant of such channels where the state…

Information Theory · Computer Science 2022-02-22 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. In quantum information theory the no-cloning theorem means that noiseless copying and feedback of quantum…

Quantum Physics · Physics 2016-11-17 Garry Bowen

The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because the results were negative:…

Information Theory · Computer Science 2007-12-07 Anant Sahai

In this paper, a general binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are calculated for the case of an…

Information Theory · Computer Science 2018-01-09 Oron Sabag , Haim H. Permuter , Navin Kashyap

We consider point-to-point communication over $q$-ary adversarial channels with partial noiseless feedback. In this setting, a sender Alice transmits $n$ symbols from a $q$-ary alphabet over a noisy forward channel to a receiver Bob, while…

Information Theory · Computer Science 2023-05-25 Eric Ruzomberka , Yongkyu Jang , David J. Love , H. Vincent Poor

In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a…

Information Theory · Computer Science 2007-10-04 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

We address the problem of correcting a single error in an arbitrary discrete memoryless channel with error-free instantaneous feedback. For the case of a one-time feedback, we propose a method for constructing optimal transmission…

Information Theory · Computer Science 2023-01-06 Ilya Vorobyev , Alexey Lebedev , Vladimir Lebedev , Christian Deppe

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise…

Information Theory · Computer Science 2007-07-16 Young-Han Kim

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

We propose two coding schemes for discrete memoryless broadcast channels (DMBCs) with rate-limited feedback from only one receiver. For any positive feedback rate and for the class of strictly less-noisy DMBCs, our schemes strictly improve…

Information Theory · Computer Science 2013-07-23 Youlong Wu , Michèle Wigger

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

Information Theory · Computer Science 2018-03-21 David Elkouss , David Pérez-García
‹ Prev 1 3 4 5 6 7 10 Next ›