English
Related papers

Related papers: Interlocked permutations

200 papers

Berlekamp and Zigangirov completely determined the capacity error function for binary error correcting codes with noiseless feedback. It is still an unsolved problem if the upper bound for the capacity error function in the non-binary case…

Information Theory · Computer Science 2020-11-20 Christian Deppe , Vladimir Lebedev

We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be…

Quantum Physics · Physics 2009-11-11 Dennis Kretschmann , Reinhard F. Werner

We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain operator space as the quantum generalisation of the adjacency matrix, in terms of…

Quantum Physics · Physics 2013-04-19 Runyao Duan , Simone Severini , Andreas Winter

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

This article studies the zero-error feedback capacity of {\em causal} discrete channels with memory. First, by extending the classical zero-error feedback capacity concept, a new notion of {\em uniform zero-error feedback capacity} $ C_{0f}…

Information Theory · Computer Science 2022-06-02 Amir Saberi , Farhad Farokhi , Girish Nair

In this paper from communication channel coding perspective we are able to present both a theoretical and practical discussion of AI's uncertainty, capacity and evolution for pattern classification based on the classical Rademacher…

Machine Learning · Computer Science 2021-02-16 Mingyong Zhou

The zero-error capacity of a discrete classical channel was first defined by Shannon as the least upper bound of rates for which one transmits information with zero probability of error. The problem of finding the zero-error capacity $C_0$,…

Information Theory · Computer Science 2020-09-24 Holger Boche , Christian Deppe

We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive…

Information Theory · Computer Science 2022-09-22 Sergey Tridenski , Anelia Somekh-Baruch

The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms…

Quantum Physics · Physics 2016-05-31 Nilanjana Datta , Marco Tomamichel , 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 consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…

Quantum Physics · Physics 2017-01-27 Holger Boche , Gisbert Janßen , Stephan Kaltenstadler

In this paper, we study the zero-error capacity for finite state channels with feedback when channel state information is known to both the transmitter and the receiver. We prove that the zero-error capacity in this case can be obtained…

Information Theory · Computer Science 2009-07-14 Lei Zhao , Haim Permuter

Any physical process can be represented as a quantum channel mapping an initial state to a final state. Hence it can be characterized from the point of view of communication theory, i.e., in terms of its ability to transfer information.…

Quantum Physics · Physics 2014-12-16 F. Caruso , V. Giovannetti , C. Lupo , S. Mancini

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

We study the optimal rates of emulation (also called interconversion) between quantum channels. When the source and the target channels are idempotent, we give a single-letter expression for the zero-error emulation capacity in terms of…

Quantum Physics · Physics 2025-12-04 Idris Delsol , Omar Fawzi , Li Gao , Mizanur Rahaman

In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Stefano Mancini

In this paper, we initiate a first information-theoretic study on multilevel NAND flash memory channels with intercell interference. More specifically, for a multilevel NAND flash memory channel under mild assumptions, we first prove that…

Information Theory · Computer Science 2016-11-15 Yonglong Li , Aleksandar Kavcic , Guangyue Han

For most discrete memoryless channels, there does not exist a linear code for the channel which uses all of the channel's input symbols. Therefore, linearity of the code for such channels is a very restrictive condition and there should be…

Information Theory · Computer Science 2011-02-17 Aria Ghasemian Sahebi , S. Sandeep Pradhan

We define the quantum zero-error capacity, a new kind of classical capacity of a noisy quantum channel. Moreover, the necessary requirement for which a quantum channel has zero-error capacity greater than zero is also given.

Quantum Physics · Physics 2007-05-23 Rex A. C. Medeiros , Francisco M. de Assis

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