English
Related papers

Related papers: Comment on Improved Analysis of List Decoding and …

200 papers

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

Guessing random additive noise decoding (GRAND) is a universal maximum-likelihood decoder that recovers code-words by guessing rank-ordered putative noise sequences and inverting their effect until one or more valid code-words are obtained.…

Information Theory · Computer Science 2023-04-18 Hadi Sarieddeen , Muriel Médard , Ken. R. Duffy

Superposition codes are efficient for the Additive White Gaussian Noise channel. We provide here a replica analysis of the performances of these codes for large signals. We also consider a Bayesian Approximate Message Passing decoder based…

Information Theory · Computer Science 2014-10-03 Jean Barbier , Florent Krzakala

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…

Information Theory · Computer Science 2016-11-17 Neri Merhav

A continuous-time white Gaussian channel can be formulated using a white Gaussian noise, and a conventional way for examining such a channel is the sampling approach based on the Shannon-Nyquist sampling theorem, where the original…

Information Theory · Computer Science 2018-10-18 Xianming Liu , Guangyue Han

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as $2^{(n\log n)R}$, where $n$ and $R$ are the block…

Information Theory · Computer Science 2021-09-29 Mohammad J. Salariseddigh , Uzi Pereg , Holger Boche , Christian Deppe , Robert Schober

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from…

Information Theory · Computer Science 2014-03-20 Alexander Gruner , Michael Huber

Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in…

Information Theory · Computer Science 2022-12-20 Mengxiao Liu , Yuejun Wei , Zhenyuan Chen , Wenyi Zhang

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

Information Theory · Computer Science 2024-12-10 Michael Peleg , Shlomo Shamai

List recovery is a fundamental task for error-correcting codes, vastly generalizing unique decoding from worst-case errors and list decoding. Briefly, one is given ''soft information'' in the form of input lists S_1,...,S_n of bounded size,…

Information Theory · Computer Science 2025-10-10 Nicolas Resch , S. Venkitesh

This paper provides an upper-bound for the capacity of the underwater acoustic (UWA) channel with dominant noise sources and generalized fading environments. Previous works have shown that UWA channel noise statistics are not necessary…

Information Theory · Computer Science 2014-04-29 Mustafa A. Kishk , Ahmed M. Alaa

Motivated by the practical constraints arising in emerging sensor network and Internet-of-Things (IoT) applications, the zero-delay transmission of a Gaussian measurement over a real single-input multiple-output (SIMO) additive white…

Information Theory · Computer Science 2017-06-01 Morteza Varasteh , Borzoo Rassouli , Osvaldo Simeone , Deniz Gunduz

A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…

Information Theory · Computer Science 2020-07-02 Ruslan Morozov , Peter Trifonov

Asymptotic energy-distortion performance of zero-delay communication scenarios under additive white Gaussian noise is investigated. Using high-resolution analysis for quantizer design, the higher-order term in the logarithm of the…

Information Theory · Computer Science 2018-01-01 Ceren Sevinç , Ertem Tuncel

Wearable electrocardiogram (ECG) measurement using dry electrodes has a problem with high-intensity noise distortion. Hence, a robust noise reduction method is required. However, overlapping frequency bands of ECG and noise make noise…

Signal Processing · Electrical Eng. & Systems 2025-01-14 Takamasa Terada , Masahiro Toyoura

In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white…

Information Theory · Computer Science 2015-04-17 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

Cross-entropy loss has long been the standard choice for training deep neural networks, yet it suffers from interpretability limitations, unbounded weight growth, and inefficiencies that can contribute to costly training dynamics. The…

Machine Learning · Computer Science 2026-04-30 Maxwell Miller-Golub , Collin Coil , Kamil Faber , Marcin Pietron , Panpan Zheng , Pasquale Minervini , Roberto Corizzo

A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically…

Information Theory · Computer Science 2016-05-31 Georg Böcherer