English
Related papers

Related papers: Correction to "The Generalized Stochastic Likeliho…

200 papers

In this note, we give a probabilistic interpretation of the Central Limit Theorem used for approximating isotropic Gaussians in [1].

Information Theory · Computer Science 2011-09-29 Kunal Narayan Chaudhury

We propose a two-sample extended empirical likelihood for inference on the difference between two p-dimensional parameters defined by estimating equations. The standard two-sample empirical likelihood for the difference is Bartlett…

Statistics Theory · Mathematics 2014-12-24 Min Tsao , Fan Wu

Shaping gain is attained in schemes where a shaped subcode is chosen from a larger codebook by a codeword selection process. This includes the popular method of Trellis Shaping (TS), originally proposed by Forney for average power…

Information Theory · Computer Science 2013-08-28 Stella Achtenberg , Dan Raphaeli

In Part I of this article (Banerjee and Kuchibhotla (2023)), we have introduced a new method to bound the difference in expectations of an average of independent random vector and the limiting Gaussian random vector using level sets. In the…

Probability · Mathematics 2023-06-27 Arun Kumar Kuchibhotla

The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential-sphere bound (TSB) and two of its recent improved versions. The paper is focused on the derivation of the…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…

Information Theory · Computer Science 2012-07-26 Kenneth Andrews , Sam Dolinar

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

Rings and Algebras · Mathematics 2020-02-18 Bui Xuan Hai

In a recent study [Rohde et al., quant-ph/0603130 (2006)] of several quantum error correcting protocols designed for tolerance against qubit loss, it was shown that these protocols have the undesirable effect of magnifying the effects of…

Quantum Physics · Physics 2008-05-19 Henry L. Haselgrove , Peter P. Rohde

In this work it is shown that locally repairable codes (LRCs) can be list-decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error-correction capabilities. The corresponding decoding radius…

Information Theory · Computer Science 2020-09-16 Lukas Holzbaur , Sven Puchinger , Antonia Wachter-Zeh

We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…

Information Theory · Computer Science 2026-01-21 Jens Zumbrägel

We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure (L+1)/L-extended Bounded Distance decoder, i.e. a decoder which corrects e errors and t erasures…

Information Theory · Computer Science 2012-02-07 Christian Senger , Vladimir R. Sidorenko , Martin Bossert , Victor V. Zyablov

The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each…

Number Theory · Mathematics 2016-10-28 Alan Haynes , Henna Koivusalo

The article starts with new aliasing-truncation error upper bounds in the sampling theorem for non-bandlimited stochastic signals. Then, it investigates $L_p([0,T])$ approximations of sub-Gaussian random signals. Explicit truncation error…

Information Theory · Computer Science 2016-08-15 Yuriy Kozachenko , Andriy Olenko

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

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 has been withrawn by the author due the error in the proof of theoem 1.

Quantum Physics · Physics 2007-05-23 Zai-Zhe Zhong

We prove a Central Limit Theorem for the linear statistics of two-dimensional Coulomb gases, with arbitrary inverse temperature and general confining potential, at the macroscopic and mesoscopic scales and possibly near the boundary of the…

Mathematical Physics · Physics 2018-03-01 Thomas Leblé , Sylvia Serfaty

Consider an ensemble of regular generalized LDPC (GLDPC) codes and assume that the same component code is associated with each parity check node. To decode a GLDPC code from the ensemble, we use the bit flipping bounded distance decoding…

Information Theory · Computer Science 2025-07-17 David Burshtein

The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially…

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

There is an error in the proof (but not the truth) of Theorem 3.2 in the author's 1985 paper "The Double-Wedge Algebra for Quantum Fields on Schwarzschild and Minkowski Spacetimes" in "Communications in Mathematical Physics". The author…

Mathematical Physics · Physics 2025-06-23 Bernard S. Kay
‹ Prev 1 3 4 5 6 7 10 Next ›