中文
相关论文

相关论文: Sharp moment-entropy inequalities and capacity bou…

200 篇论文

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

信息论 · 计算机科学 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises,…

量子物理 · 物理学 2019-05-21 Youngrong Lim , Soojoon Lee , Jaewan Kim , Kabgyun Jeong

We study the classical problem of characterizing the channel capacity and its achieving distribution in a generic fashion. We derive a simple relation between three parameters: the input-output function, the input cost function and the…

信息论 · 计算机科学 2017-11-17 Jihad Fahs , Ibrahim Abou-Faycal

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…

信息论 · 计算机科学 2011-06-01 Tobias Koch , Amos Lapidoth

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The…

信息论 · 计算机科学 2016-11-18 K. Alishahi , F. Marvasti , V. Aref , P. Pad

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…

信息论 · 计算机科学 2026-01-16 Adway Girish , Shlomo Shamai , Emre Telatar

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

信息论 · 计算机科学 2023-10-30 Jennifer Tang , Yury Polyanskiy

In this paper, we consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support…

量子物理 · 物理学 2007-05-23 C. King , M. B. Ruskai

Tight lower and upper bounds on the ratio of relative entropies of two probability distributions with respect to a common third one are established, where the three distributions are collinear in the standard $(n-1)$-simplex. These bounds…

信息论 · 计算机科学 2018-05-31 Shengtian Yang , Jun Chen

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,…

信息论 · 计算机科学 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the…

量子物理 · 物理学 2017-12-06 Alexander Müller-Hermes , Daniel Stilck Franca , Michael M. Wolf

Almost all modern communication systems rely on electromagnetic fields as a means of information transmission, and finding the capacities of these systems is a problem of significant practical importance. The Additive White Gaussian Noise…

量子物理 · 物理学 2013-02-05 Robert Koenig , Graeme Smith

The capacity of a discrete-time channel with correlated phase noises is investigated. In particular, the electro-optic frequency comb system is considered, where the phase noise of each subchannel is a combination of two independent Wiener…

信息论 · 计算机科学 2025-07-15 Mohammad Farsi , Hamdi Joudeh , Gabriele Liga , Alex Alvarado , Magnus Karlsson , Erik Agrell

We investigate the capacity of noisy frequency-based channels, motivated by DNA data storage in the short-molecule regime, where information is encoded in the frequency of items types rather than their order. The channel output is a…

信息论 · 计算机科学 2026-01-16 Yuval Gerzon , Ilan Shomorony , Nir Weinberger

This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager…

信息论 · 计算机科学 2009-01-19 Yiyue Wu , Linda M. Davis , Robert Calderbank

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

信息论 · 计算机科学 2024-11-19 Shuqin Pang , Wenyi Zhang

We consider a line with noise in the simplest case. Loss does not add noise. Amplification via phase insensitive amplifiers do add noise. A lower bound of this capacity is the quantum analog to the Shannon capacity of a linear channel with…

量子物理 · 物理学 2013-03-05 Antonio Mecozzi

A popular approach to learning encoders for lossy compression is to use additive uniform noise during training as a differentiable approximation to test-time quantization. We demonstrate that a uniform noise channel can also be implemented…

机器学习 · 统计学 2020-10-22 Eirikur Agustsson , Lucas Theis

The most natural way to describe an information-carrying system containing a specific noise is an additive white Gaussian-noise (AWGN) channel. In bosonic quantum systems (especially the Gaussian case), although the classical information…

量子物理 · 物理学 2019-05-14 Kabgyun Jeong , Hun Hee Lee , Youngrong Lim

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

信息论 · 计算机科学 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith