English
Related papers

Related papers: Zero-error channel capacity and simulation assiste…

200 papers

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

Quantum Physics · Physics 2015-06-12 Holger Boche , Janis Noetzel

We analyse a communication scenario over a particular causal broadcast channel whose state depends on a modulo sum. The receivers of the broadcast receive channel state information and collaborate to determine the channel state as to decode…

Information Theory · Computer Science 2021-02-16 Stephen DiAdamo , Janis Nötzel

It is known that for a discrete channel with correlated additive noise, the ordinary capacity with or without feedback both equal $ \log q-\mathcal{H} (Z) $, where $ \mathcal{H}(Z) $ is the entropy rate of the noise process $ Z $ and $ q $…

Information Theory · Computer Science 2020-06-02 Amir Saberi , Farhad Farokhi , Girish N. Nair

We consider a communication scenario over a discrete memoryless interference channel or multiple access channel without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. In this scenario, several previous…

Quantum Physics · Physics 2026-01-05 Seung-Hyun Nam , Hyun-Young Park , Jiyoung Yun , Ashutosh Rai , Si-Hyeon Lee , Joonwoo Bae

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

The zero-error capacity of a channel (or Shannon capacity of a graph) quantifies how much information can be transmitted with no risk of error. In contrast to the Shannon capacity of a channel, the zero-error capacity has not even been…

Information Theory · Computer Science 2024-03-19 Alexander Meiburg

The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…

Information Theory · Computer Science 2015-10-22 Masahito Hayashi , Vincent Y. F. Tan

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

One of the most surprising recent results in quantum Shannon theory is the superactivation of the quantum capacity of a quantum channel. This phenomenon has its roots in the extreme violation of additivity of the channel capacity and…

Quantum Physics · Physics 2012-08-28 Laszlo Gyongyosi , Sandor Imre

We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit…

Quantum Physics · Physics 2013-07-23 Nigum Arshed , A. H. Toor

Entanglement-assisted quantum communication employs pre-shared entanglement between sender and receiver as a resource. We apply the same framework to quantum metrology, introducing shared entanglement between the preparation and the…

Quantum Physics · Physics 2016-07-06 Zixin Huang , Chiara Macchiavello , Lorenzo Maccone

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. We show that there exist pairs of quantum…

Quantum Physics · Physics 2012-01-31 Toby S. Cubitt , Jianxin Chen , Aram W. Harrow

Two familiar notions of correlation are rediscovered as extreme operating points for simulating a discrete memoryless channel, in which a channel output is generated based only on a description of the channel input. Wyner's "common…

Information Theory · Computer Science 2008-05-02 Paul Cuff

Transmission of quantum entanglement will play a crucial role in future networks and long-distance quantum communications. Quantum Key Distribution, the working mechanism of quantum repeaters and the various quantum communication protocols…

Quantum Physics · Physics 2013-10-08 Laszlo Gyongyosi

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…

Quantum Physics · Physics 2009-02-20 Graeme Smith , Jon Yard

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

Information Theory · Computer Science 2016-11-15 Maël Le Treust

We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) Time is slotted, 2) at most $ N…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Petar Popovski
‹ Prev 1 3 4 5 6 7 10 Next ›