English
Related papers

Related papers: The single-serving channel capacity

200 papers

We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3.…

Data Structures and Algorithms · Computer Science 2015-01-06 Klim Efremenko , Ran Gelles , Bernhard Haeupler

In this paper, a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$ is considered. The capacity of this channel is computed when independent noisy versions of $S$ are known to the transmitter…

Information Theory · Computer Science 2008-06-18 Yong Peng , Dinesh Rajan

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

In this paper, we study the information-theoretic limits of oblivious transfer via noisy channels. We also investigate oblivious transfer over a noisy multiple-access channel with two non-colluding senders and a single receiver. The channel…

Information Theory · Computer Science 2025-12-23 Hadi Aghaee , Bahareh Akhbari , Christian Deppe

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

In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

Information Theory · Computer Science 2010-11-24 Woohyuk Chang , Sae-Young Chung , Yong H. Lee

Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length $n$ such that the error probability goes to zero as $n$ goes to infinity. In this definition, it is implicit that the block…

Information Theory · Computer Science 2010-06-03 Rui A. Costa , Michael Langberg , João Barros

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

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

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that…

Information Theory · Computer Science 2008-08-18 Marat V. Burnashev , Hirosuke Yamamoto

We study the behavior of channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Gaussian channel. We focus on the low signal-to-noise ratio regime, where communication at very low…

Information Theory · Computer Science 2011-06-01 Tobias Koch , Amos Lapidoth

A one-bit wireless transceiver is a promising communication architecture that not only can facilitate the design of mmWave communication systems but also can extremely diminish power consumption. The non-linear distortion effects by one-bit…

Information Theory · Computer Science 2018-11-15 Yunseo Nam , Heedong Do , Yo-Seb Jeon , Namyoon Lee

Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy…

Cryptography and Security · Computer Science 2019-05-28 Claude Crépeau , Rafael Dowsley , Anderson C. A. Nascimento

We consider the transmission of nonexponentially many messages through a binary symmetric channel with noiseless feedback. We obtain an upper bound for the best decoding error exponent. Combined with the corresponding known lower bound,…

Information Theory · Computer Science 2022-10-14 Marat V. Burnashev

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…

Quantum Physics · Physics 2009-10-30 Seth Lloyd

In this paper, we investigate the capacity of massive multiple-input multiple-output (MIMO) systems corrupted by complex-valued additive white Gaussian noise (AWGN) when both the transmitter and the receiver employ 1-bit digital-to-analog…

Information Theory · Computer Science 2019-11-13 Armin Bazrafkan , Nikola Zlatanov

We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the…

Information Theory · Computer Science 2018-04-05 Hua Sun

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

We present an optimized secure multi-antenna transmission approach based on artificial-noise-aided beamforming, with limited feedback from a desired single-antenna receiver. To deal with beamformer quantization errors as well as unknown…

Information Theory · Computer Science 2015-01-22 Xi Zhang , Matthew R. McKay , Xiangyun Zhou , Robert W. Heath

In digital systems such as fiber optical communications, the ratio between probability of errors of type $1\to 0$ and $0 \to 1$ can be large. Practically, one can assume that only one type of error can occur. These errors arecalled…

Information Theory · Computer Science 2020-04-29 Christian Deppe , Vladimir Lebedev , Georg Maringer
‹ Prev 1 2 3 10 Next ›