English
Related papers

Related papers: Error Probability Bounds for Gaussian Channels und…

200 papers

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…

Information Theory · Computer Science 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

It is common practice to collect observations of feature and response pairs from different environments. A natural question is how to identify features that have consistent prediction power across environments. The invariant causal…

Information Theory · Computer Science 2022-07-01 Austin Goddard , Yu Xiang , Ilya Soloveychik

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

New upper and lower bounds for the error probability over an erasure channel are provided, making use of Wei's generalized weights, hierarchy and spectra. In many situations the upper and lower bounds coincide and this allows improvement of…

Information Theory · Computer Science 2014-07-18 Leandro Cruvinel Lemes , Marcelo Firer

We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…

Information Theory · Computer Science 2013-02-12 Eli Haim , Yuval Kochman , Uri Erez

We determine lower and upper bounds on the capacity of bandlimited optical intensity channels (BLOIC) with white Gaussian noise. Three types of input power constraints are considered: 1) only an average power constraint, 2) only a peak…

Information Theory · Computer Science 2017-02-14 Jing Zhou , Wenyi Zhang

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the…

Information Theory · Computer Science 2020-07-08 Xinchun Yu , Shuangqin Wei , Yuan Luo

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

Quantum Physics · Physics 2019-05-21 Youngrong Lim , Soojoon Lee , Jaewan Kim , Kabgyun Jeong

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…

Information Theory · Computer Science 2025-09-15 Adeel Mahmood , Aaron B. Wagner

Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…

Information Theory · Computer Science 2015-06-11 Junya Honda

The capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

Information Theory · Computer Science 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…

Information Theory · Computer Science 2018-06-01 Uzi Pereg , Yossef Steinberg

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…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a non-vanishing probability of error. The output distribution induced by an…

Information Theory · Computer Science 2013-09-03 Yury Polyanskiy , Sergio Verdu

Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping between codeword bits and channels of different quality, and…

Information Theory · Computer Science 2019-05-06 Thomas Wiegart , Tobias Prinz , Fabian Steiner , Peihong Yuan

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse