English
Related papers

Related papers: Channel Coding for Gaussian Channels with Mean and…

200 papers

We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…

Information Theory · Computer Science 2022-12-12 Bruno Bauwens , Marius Zimand

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

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

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

This paper studies the achievable rate region of the two-user single-input-single-output (SISO) Gaussian interference channel, when the improper Gaussian signaling is applied. Under the assumption that the interference is treated as…

Information Theory · Computer Science 2012-05-10 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

We provide a complete characterization of the achievable distortion region for the problem of sending a bivariate Gaussian source over bandwidth-matched Gaussian broadcast channels, where each receiver is interested in only one component of…

Information Theory · Computer Science 2010-06-04 Chao Tian , Suhas Diggavi , Shlomo Shamai

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool.…

Information Theory · Computer Science 2025-04-28 Ran Tamir , Nir Weinberger

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable…

Information Theory · Computer Science 2015-01-20 Nir Elkayam , Meir Feder

This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed {channels} whose channel law is characterized by a general mixture of (at most) uncountably many stationary and…

Information Theory · Computer Science 2016-05-09 Hideki Yagi , Te Sun Han , Ryo Nomura

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the…

Information Theory · Computer Science 2016-11-17 Marius Kleiner , Bixio Rimoldi

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…

Information Theory · Computer Science 2016-11-15 Jie Luo

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

This paper shows the strong converse and the dispersion of memoryless channels with cost constraints and performs refined analysis of the third order term in the asymptotic expansion of the maximum achievable channel coding rate, showing…

Information Theory · Computer Science 2015-10-09 Victoria Kostina , Sergio Verdú

In this paper, Gaussian two-way channel with uniform output quantization is studied. For Gaussian inputs, the optimum uniform finite-level quantizer is determined numerically for different values of Signal-to-Noise Ratio (SNR). The two-way…

Information Theory · Computer Science 2016-05-04 Ershad Banijamali

The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel…

Information Theory · Computer Science 2011-09-27 Amin Jafarian , Sriram Vishwanath