English
Related papers

Related papers: A Counterexample to Cover's 2P Conjecture on Gauss…

200 papers

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…

Information Theory · Computer Science 2026-03-26 Haiyang Wang , Luca Barletta , Alex Dytso

We present some of the peculiar dynamics of two simple sans-entanglement quantum communication channels in a digestible form. Specifically, we contrast the classical gaussian additive channel to its quantum analogue and find that the…

Quantum Physics · Physics 2024-06-18 Miles Miller-Dickson , Christopher Rose

The main objective of this paper is to derive a new sequential characterization of the Cover and Pombra \cite{cover-pombra1989} characterization of the $n-$finite block or transmission feedback information ($n$-FTFI) capacity, which…

Information Theory · Computer Science 2021-06-10 Charalambos D. Charalambous , Christos Kourtellaris , Stelios Louka

This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points,…

Information Theory · Computer Science 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we…

Information Theory · Computer Science 2023-02-17 Mouli Chakraborty , Harun Siljak , Indrakshi Dey , Nicola Marchetti

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

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

We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with…

Information Theory · Computer Science 2018-04-20 Adriano Pastore

The applications of the general formulae of channel capacity developed in the quantum information theory to evaluation of information transmission capacity of optical channel are interesting subjects. In this review paper, we will point out…

Quantum Physics · Physics 2007-05-23 Masaki Sohma , Osamu Hirota

Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…

Information Theory · Computer Science 2020-11-03 Jin-Yuan Wang , Xian-Tao Fu , Rong-Rong Lu , Jun-Bo Wang , Min Lin , Julian Cheng

The feedback sum-rate capacity is established for the symmetric $J$-user Gaussian multiple-access channel (GMAC). The main contribution is a converse bound that combines the dependence-balance argument of Hekstra and Willems (1989) with a…

Information Theory · Computer Science 2018-11-26 Erixhen Sula , Michael Gastpar , Gerhard Kramer

The capacity of stationary additive Gaussian noise channels with feedback is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

For the discrete-time additive white generalized Gaussian noise channel with a generalized input power constraint, with the respective shape and power parameters >= 1, we derive an upper bound on the optimal block error exponent. Explicit…

Information Theory · Computer Science 2025-09-11 Sergey Tridenski , Anelia Somekh-Baruch

The capacity of the discrete-time channel affected by both additive Gaussian noise and Wiener phase noise is studied. Novel inner and outer bounds are presented, which differ of at most $6.65$ bits per channel use for all channel…

Information Theory · Computer Science 2017-01-19 Luca Barletta , Stefano Rini

This paper provides an upper-bound for the capacity of the underwater acoustic (UWA) channel with dominant noise sources and generalized fading environments. Previous works have shown that UWA channel noise statistics are not necessary…

Information Theory · Computer Science 2014-04-29 Mustafa A. Kishk , Ahmed M. Alaa

We study memoryless, discrete time, matrix channels with additive white Gaussian noise and input power constraints of the form $Y_i = \sum_j H_{ij} X_j + Z_i$, where $Y_i$ ,$X_j$ and $Z_i$ are complex, $i=1..m$, $j=1..n$, and $H$ is a…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Anirvan Mayukh Sengupta , Partha Pratim Mitra

The long-standing conjectures of the optimality of Gaussian inputs for Gaussian channel and Gaussian additivity are solved for a broad class of covariant or contravariant Bosonic Gaussian channels (which includes in particular thermal,…

Quantum Physics · Physics 2015-03-04 V. Giovannetti , A. S. Holevo , R. Garcia-Patron

This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points.…

Information Theory · Computer Science 2021-09-06 Luca Barletta , Alex Dytso

The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both…

Quantum Physics · Physics 2011-10-20 Tony Dorlas , Ciara Morgan

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu