English
Related papers

Related papers: The single-serving channel capacity

200 papers

It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only…

Information Theory · Computer Science 2015-02-18 Sibi Raj B. Pillai , Vinod M. Prabhakaran

This paper concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not…

Information Theory · Computer Science 2020-03-31 Alejandro Lancho , Tobias Koch , Giuseppe Durisi

It is well known that the capacity region of an average transmit power constrained Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers is enlarged by the presence of causal noiseless feedback. Capacity…

Information Theory · Computer Science 2020-09-21 Aditya Narayan Ravi , Sibi Raj B. Pillai , Vinod Prabhakaran , Michèle Wigger

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

We introduce the one-cold Poisson channel (OCPC), where the transmitter chooses one of several frequency bands to attenuate at a time. In particular, the perfect OCPC, where the number of bands is unlimited, is an extremely simple…

Information Theory · Computer Science 2026-01-16 Cheuk Ting Li

This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite…

Information Theory · Computer Science 2026-02-04 Hadi Aghaee , Christian Deppe , Holger Boche

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

We obtain a lower bound on the maximum number of qubits, $Q^{n, \epsilon}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\epsilon$. To obtain our result, we…

Quantum Physics · Physics 2024-12-31 Salman Beigi , Nilanjana Datta , Felix Leditzky

We give analytic upper bounds to the channel capacity C for transmission of classical information in electromagnetic channels (bosonic channels with thermal noise). In the practically relevant regimes of high noise and low transmissivity,…

Quantum Physics · Physics 2015-06-11 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone , Jeffrey H. Shapiro

In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It…

Cryptography and Security · Computer Science 2007-05-23 Andreas Winter , Anderson C. A. Nascimento , Hideki Imai

To model printing noise a binary noisy channel and a set of controlled gates are introduced. The channel input is an image created by a halftoning algorithm and its output is the printed picture. Using this channel robustness to noise…

Other Computer Science · Computer Science 2015-03-19 V. N. Gorbachev , E. S. Yakovleva

We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user.…

Information Theory · Computer Science 2016-11-15 Ahmed Benfarah , Stefano Tomasin , Nicola Laurenti

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 present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an…

Information Theory · Computer Science 2013-10-18 Boulat A. Bash , Dennis Goeckel , Don Towsley

Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of…

Quantum Physics · Physics 2009-11-13 Saikat Guha , Jeffrey H. Shapiro , Baris I. Erkmen

The capacities of noisy quantum channels capture the ultimate rates of information transmission across quantum communication lines, and the quantum capacity plays a key role in determining the overhead of fault-tolerant quantum computation…

Quantum Physics · Physics 2024-09-04 Ludovico Lami , Mark M. Wilde

Estimating the information transmission capability of a quantum channel remains one of the fundamental problems in quantum information processing. In contrast to classical channels, the information-carrying capability of quantum channels is…

Quantum Physics · Physics 2024-07-26 Aditya Nema , Ananda G. Maity , Sergii Strelchuk , David Elkouss

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

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

In this paper, we study the problem of relaying a single bit over a tandem of binary-input channels, with the goal of attaining the highest possible error exponent in the exponentially decaying error probability. Our previous work gave an…

Information Theory · Computer Science 2024-06-07 Yan Hao Ling , Jonathan Scarlett