English
Related papers

Related papers: Geometric Relationships Between Gaussian and Modul…

200 papers

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

In this paper, we investigate an algorithm to attain additive white Gaussian noise (AWGN) performance in spectrally non-white channels, using multicarrier communications, i.e., orthogonal frequency division multiplexing (OFDM) and…

Signal Processing · Electrical Eng. & Systems 2021-09-14 Hosseinali Jamal , David W. Matolak

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…

Information Theory · Computer Science 2020-06-01 Hengjia Wei , Xin Wang , Moshe Schwartz

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

The efficacy of a specially constructed Gallager-type error-correcting code to communication in a Gaussian channel is being examined. The construction is based on the introduction of complex matrices, used in both encoding and decoding,…

Disordered Systems and Neural Networks · Physics 2009-10-31 Ido Kanter , David Saad

We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels…

Information Theory · Computer Science 2015-01-13 Harish Vangala , Emanuele Viterbo , Yi Hong

This paper investigates the bounds on channel capacity and constellation shaping under memoryless mixed noise, which is composed of impulsive noise (IN) and white Gaussian noise (WGN). The capacity bounds are derived using the entropy power…

Information Theory · Computer Science 2025-12-04 Tianfu Qi , Jun Wang

Generalized mutual information (GMI) is used to compute achievable rates for fading channels with various types of channel state information at the transmitter (CSIT) and receiver (CSIR). The GMI is based on variations of auxiliary channel…

Information Theory · Computer Science 2023-05-23 Gerhard Kramer

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…

Information Theory · Computer Science 2024-04-25 M. Yusuf Şener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

This paper studies the sample complexity of learning the $k$ unknown centers of a balanced Gaussian mixture model (GMM) in $\mathbb{R}^d$ with spherical covariance matrix $\sigma^2\mathbf{I}$. In particular, we are interested in the…

Information Theory · Computer Science 2022-06-15 Elad Romanov , Tamir Bendory , Or Ordentlich

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

Information Theory · Computer Science 2026-01-21 Sebastian Bitzer , Alberto Ravagnani , Violetta Weger

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Information Theory · Computer Science 2020-10-08 Hideki Ochiai , Patrick Mitran , H. Vincent Poor

We consider the distributional connection between the lossy compressed representation of a high-dimensional signal $X$ using a random spherical code and the observation of $X$ under an additive white Gaussian noise (AWGN). We show that the…

Information Theory · Computer Science 2021-12-14 Alon Kipnis , Galen Reeves

This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks of harvested energy, which is known…

Information Theory · Computer Science 2017-09-05 Silas L. Fong , Vincent Y. F. Tan , Ayfer Özgür

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also feedback channel with independent additive Gaussian noise, and the transmitter observes without delay all outputs of the…

Information Theory · Computer Science 2012-08-15 M. V. Burnashev , H. Yamamoto

The protograph low-density parity-check (LDPC) codes possess many attractive properties, such as the low encoding/decoding complexity and better error floor performance, and hence have been successfully applied to different types of…

Information Theory · Computer Science 2019-05-01 Xingwei Zhong , Kui Cai , Pingping Chen , Zhen Mei

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

For the discrete-time additive white generalized Gaussian noise channel with a generalized input power constraint, with the respective shape and power parameters >= 1, we derive an upper bound on the optimal block error exponent. Explicit…

Information Theory · Computer Science 2025-09-11 Sergey Tridenski , Anelia Somekh-Baruch

In this paper we introduce a novel performance analysis of the ${\eta}$-${\mu}$ generalized radio fading channels with integer value of the ${\mu}$ fading parameter, i.e. with even number of multipath clusters. This fading model includes…

Information Theory · Computer Science 2017-03-14 Ehab Salahat , Murad Qasaimeh

A classical result in Information Theory states that the Gaussian noise is the worst-case additive noise in point-to-point channels, meaning that, for a fixed noise variance, the Gaussian noise minimizes the capacity of an additive noise…

Information Theory · Computer Science 2013-01-30 Ilan Shomorony , A. Salman Avestimehr