English
Related papers

Related papers: Information-Theoretic Extensions of the Shannon-Ny…

200 papers

The classical sampling Nyquist-Shannon-Kotelnikov theorem states that a band-limited continuous time function can be uniquely recovered without error from a infinite two-sided sampling series taken with a sufficient frequency. This short…

Information Theory · Computer Science 2016-03-22 Nikolai Dokuchaev

This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…

Information Theory · Computer Science 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

Cells must continuously sense and respond to time-varying environmental stimuli. These signals are transmitted and processed by biochemical signalling networks. However, the biochemical reactions making up these networks are intrinsically…

Molecular Networks · Quantitative Biology 2015-05-18 Filipe Tostevin , Pieter Rein ten Wolde

Shannon's Capacity Theorem is the main concept behind the Theory of Communication. It says that if the amount of information contained in a signal is smaller than the channel capacity of a physical media of communication, it can be…

Chaotic Dynamics · Physics 2009-11-13 M. S. Baptista , J. Kurths

Stochastic integration \textit{wrt} Gaussian processes has raised strong interest in recent years, motivated in particular by its applications in Internet traffic modeling, biomedicine and finance. The aim of this work is to define and…

Probability · Mathematics 2018-02-15 Joachim Lebovits

We report on novel Brownian, yet non-Gaussian diffusion, in which the mean square displacement of the particle grows linearly with time, the probability density for the particle spreading is Gaussian-like, however, the probability density…

Statistical Mechanics · Physics 2020-10-28 K. Białas , J. Łuczka , P. Hänggi , J. Spiechowicz

The necessary and sufficient conditions of optimality of the decoding of quantum signals minimizing the Bayesian risk are generalized for the Shannon mutual information criteria. It is shown that for a linear channel with Gaussian boson…

Quantum Physics · Physics 2007-05-23 V. P. Belavkin , A. G. Vantsyan

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

In this paper we show how \emph{the metric theory of tensor products} developed by Grothendieck perfectly fits in the study of channel capacities, a central topic in \emph{Shannon's information theory}. Furthermore, in the last years…

Functional Analysis · Mathematics 2015-02-10 Marius Junge , Carlos Palazuelos

We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections. A few examples where this problem is relevant are compressed sensing, sparse superposition codes, and code division multiple access.…

Information Theory · Computer Science 2020-08-31 Jean Barbier , Nicolas Macris , Mohamad Dia , Florent Krzakala

To fully characterize the information that two `source' variables carry about a third `target' variable, one must decompose the total information into redundant, unique and synergistic components, i.e. obtain a partial information…

Information Theory · Computer Science 2015-05-13 Adam B. Barrett

Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this paper, We study quantum…

Quantum Physics · Physics 2007-05-23 A. Fahmi

Consider a pair of terminals connected by two independent (feedforward and feedback) Additive White Gaussian Noise (AWGN) channels, and limited by individual power constraints. The first terminal would like to reliably send information to…

Information Theory · Computer Science 2015-04-16 Assaf Ben-Yishai , Ofer Shayevitz

Does semantic communication require a semantic information theory parallel to Shannon's information theory, or can Shannon's work be generalized for semantic communication? This paper advocates for the latter and introduces a semantic…

Information Theory · Computer Science 2025-10-21 Chenguang Lu

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…

Cryptography and Security · Computer Science 2020-01-22 Ke Li , Don Towsley , Dennis Goeckel

We obtain a representation theorem for Banach space valued Gaussian random variables as integrals against a white noise. As a corollary we obtain necessary and sufficient conditions for the existence of a white noise representation for a…

Probability · Mathematics 2012-01-27 Zachary Gelbaum

Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the…

Information Theory · Computer Science 2016-11-18 Paul Cuff

We derive lower and upper bounds on the identification capacity of inverse Gaussian channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time…

Information Theory · Computer Science 2026-05-08 Mohammad Javad Salariseddigh

Quantum communications using continuous variables are quite mature experimental techniques and the relevant theories have been extensively investigated with various methods. In this paper, we study the continuous variable quantum channels…

Quantum Physics · Physics 2009-11-11 Tao Qin , Meisheng Zhao , Yongde Zhang

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia