English
Related papers

Related papers: Commitment over Gaussian Unfair Noisy Channels

200 papers

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

DNA storage has emerged as a promising solution for large-scale and long-term data preservation. Among various error types, insertions are the most frequent errors occurring in DNA sequences, where the inserted symbol is often identical or…

Information Theory · Computer Science 2026-04-07 Hengfeng Liu , Chunming Tang , Cuiling Fan

We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for…

Quantum Physics · Physics 2019-06-12 Gilles Brassard , Ashwin Nayak , Alain Tapp , Dave Touchette , Falk Unger

In this paper the study of the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers. We derive the capacity for the…

Information Theory · Computer Science 2012-02-07 Stefano Rini , Carolin Huppert

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

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

We study the input-entropy-constrained Gaussian channel capacity problem in the asymptotic high signal-to-noise ratio (SNR) regime. We show that the capacity-achieving distribution as SNR goes to infinity is given by a discrete Gaussian…

Information Theory · Computer Science 2026-01-16 Adway Girish , Shlomo Shamai , Emre Telatar

In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…

Information Theory · Computer Science 2015-07-20 Nima S. Anzabi-Nezhad , Ghosheh Abed Hodtani , Mohammad Molavi Kakhki

This paper studies the capacity of the peak-and-average-power-limited Gaussian channel when its output is quantized using a dithered, infinite-level, uniform quantizer of step size $\Delta$. It is shown that the capacity of this channel…

Information Theory · Computer Science 2014-04-28 Tobias Koch

We investigate the capacity of bosonic quantum channels for the transmission of quantum information. Achievable rates are determined from measurable moments of the channel by showing that every channel can asymptotically simulate a Gaussian…

Quantum Physics · Physics 2009-11-13 Michael M. Wolf , David Perez-Garcia , Geza Giedke

Security of a continuous-variable quantum key distribution protocol based on noisy coherent states and channel is analyzed. Assuming the noise of coherent states is induced by Fred, a neutral party relative to others, we prove that the…

Quantum Physics · Physics 2015-05-13 Yong Shen , Jian Yang , Hong Guo

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

Quantum Physics · Physics 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne…

Quantum Physics · Physics 2023-07-25 A. S. Holevo , S. N. Filippov

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

Noise is the main obstacle for the realization of fault tolerant quantum information processing and secure communication over long distances. In this work, we propose a communication protocol relying on simple linear optics that optimally…

Quantum Physics · Physics 2015-06-16 Mikael Lassen , Adriano Berni , Lars S. Madsen , Radim Filip , Ulrik L. Andersen

We study finite-blocklength bounds for noisy permutation channels whose reachable output polytope may be lower-dimensional than the output simplex. Existing Gaussian achievability analyses focus on strictly positive full-rank square DMC…

Information Theory · Computer Science 2026-05-26 Lugaoze Feng , Guocheng Lv , Xunan Li. , Ye Jin
‹ Prev 1 3 4 5 6 7 10 Next ›