English
Related papers

Related papers: An Explicit Formula for the Zero-Error Feedback Ca…

200 papers

We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.

Combinatorics · Mathematics 2016-02-22 Gérard Cohen , Emanuela Fachini , János Körner

Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than -1, the gap between the sum-rate the scheme achieves and the full-cooperation bound…

Information Theory · Computer Science 2015-03-13 Michael Gastpar , Amos Lapidoth , Yossef Steinberg , Michele Wigger

The one-shot zero-error classical capacity of a quantum channel is the amount of classical information that can be transmitted with zero probability of error by a single use. Then the one-shot zero-error classical capacity equals to the…

Quantum Physics · Physics 2026-01-27 Jeonghoon Park , Jeong San Kim

We study memoryless, discrete time, matrix channels with additive white Gaussian noise and input power constraints of the form $Y_i = \sum_j H_{ij} X_j + Z_i$, where $Y_i$ ,$X_j$ and $Z_i$ are complex, $i=1..m$, $j=1..n$, and $H$ is a…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Anirvan Mayukh Sengupta , Partha Pratim Mitra

We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the…

Quantum Physics · Physics 2007-05-23 Michal Horodecki , Pawel Horodecki , Ryszard Horodecki , Debbie Leung , Barbara Terhal

We study the activated quantum no-signalling-assisted zero-error classical capacity by first allowing the assistance from some noiseless forward communication channel and later paying back the cost of the helper. This activated…

Quantum Physics · Physics 2017-12-19 Runyao Duan , Xin Wang

This paper investigates the zero-error capacity of channels with memory. Motivated by the nuanced requirements of semantic communication that incorporate memory, we advance the classical enlightened dictator channel by introducing a new…

Information Theory · Computer Science 2024-11-21 Qi Cao , Yulin Shao , Shangwei Ge

We consider a line with noise in the simplest case. Loss does not add noise. Amplification via phase insensitive amplifiers do add noise. A lower bound of this capacity is the quantum analog to the Shannon capacity of a linear channel with…

Quantum Physics · Physics 2013-03-05 Antonio Mecozzi

The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the $\rho$-th moment---of the number of messages that could have produced the output of the channel…

Information Theory · Computer Science 2014-10-16 Christoph Bunte , Amos Lapidoth

Zero-error capacity plays an important role in a whole range of operational tasks, in addition to the fact that it is necessary for practical applications. Due to the importance of zero-error capacity, it is necessary to investigate its…

Information Theory · Computer Science 2024-05-21 Holger Boche , Christian Deppe

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and…

Information Theory · Computer Science 2016-11-18 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

The zero-error channel capacity is the maximum asymptotic rate that can be reached with error probability exactly zero, instead of a vanishing error probability. The nature of this problem, essentially combinatorial rather than…

Information Theory · Computer Science 2020-01-13 Nicolas Charpenay , Maël Le Treust

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…

Information Theory · Computer Science 2021-02-11 Christian Deppe , Vladimir Lebedev , Georg Maringer , Nikita Polyanskii

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

Information Theory · Computer Science 2023-10-30 Jennifer Tang , Yury Polyanskiy

Finding a computable expression for the feedback capacity of channels with colored Gaussian, additive noise is a long standing open problem. In this paper, we solve this problem in the scenario where the channel has multiple inputs and…

Information Theory · Computer Science 2023-01-20 Oron Sabag , Victoria Kostina , Babak Hassibi

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…

Quantum Physics · Physics 2020-09-15 Dawei Ding , Yihui Quek , Peter W. Shor , Mark M. Wilde

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

We derive a single-letter formula for the zero-rate reliability (error exponent) of a finite-state channel whose state variable depends deterministically (and recursively) on past channel inputs, where the code complies with a given channel…

Information Theory · Computer Science 2016-11-15 Neri Merhav