English
Related papers

Related papers: Error Probability Bounds for Gaussian Channels und…

200 papers

The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…

Information Theory · Computer Science 2018-04-18 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…

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

Optimal coding over the additive white Gaussian noise channel under the peak energy constraint is studied when there is noisy feedback over an orthogonal additive white Gaussian noise channel. As shown by Pinsker, under the peak energy…

Information Theory · Computer Science 2011-08-19 Yu Xiang , Young-Han Kim

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

Minimum power required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each noise level, is studied for the transmission of Gaussian sources over Gaussian channels under a regime…

Information Theory · Computer Science 2020-01-22 Mohammadamin Baniasadi , Ertem Tuncel

An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem…

Information Theory · Computer Science 2021-11-17 Nir Weinberger

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

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 study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…

Information Theory · Computer Science 2011-10-11 Anusha Gorantla , Vinod Sharma

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum…

Information Theory · Computer Science 2012-08-10 Ronit Bustin , Shlomo Shamai

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2009-03-11 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2008-05-06 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error $P_{e,\min}$ as a…

Information Theory · Computer Science 2020-01-03 B. Nakiboglu , R. G. Gallager

Consider the following unequal error protection scenario. One special message, dubbed the "red alert" message, is required to have an extremely small probability of missed detection. The remainder of the messages must keep their average…

Information Theory · Computer Science 2016-11-18 Bobak Nazer , Yanina Shkel , Stark C. Draper

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles, on the erasure channel, is developed. The lower bound turns to be positive, over an ensemble specific interval of erasure probabilities,…

Information Theory · Computer Science 2019-01-23 Enrico Paolini , Gianluigi Liva

This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. The proposed method is applicable to various channels and ensembles. The focus is on both…

Information Theory · Computer Science 2022-03-01 Ralf R. Müller