Related papers: Spectral Shape of Doubly-Generalized LDPC Codes: E…
The spectral weights (SW's) for adding and removing an electron of the Gutzwiller projected d-wave superconducting (SC) state of the t-J-type models are studied numerically on finite lattices. Restrict to the uniform system but treat…
We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for…
To achieve reliable and efficient transmissions in free-space optical (FSO) communication, this paper designs a new protograph low-density parity-check (PLDPC) coded generalized spatial multipulse position modulation (GSMPPM) system over…
A solid object's geometry, density, and elastic moduli completely determine its spectrum of normal modes. Solving the inverse problem - determining a material's elastic moduli given a set of resonance frequencies and sample geometry -…
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…
Since the classical work of Berlekamp, McEliece and van Tilborg, it is well known that the problem of exact maximum-likelihood (ML) decoding of general linear codes is NP-hard. In this paper, we show that exact ML decoding of a classs of…
Spectral analysis is performed on the Born equation, a strongly singular integral equation modeling the interactions between electromagnetic waves and arbitrarily shaped dielectric scatterers. Compact and Hilbert--Schmidt operator…
We introduce a method that allows the evaluation of general expressions for the spectral functions of the one-dimensional Hubbard model for all values of the on-site electronic repulsion U. The spectral weights are expressed in terms of…
In some cases, solutions to nonlinear PDEs happen to be asymptotically (for large $x$ and/or $t$) invariant under a group $G$ which is not a symmetry of the equation. After recalling the geometrical meaning of symmetries of differential…
We consider the problem of detecting a rectangle of activation in a grid of sensors in d-dimensions with noisy measurements. This has applications to massive surveillance projects and anomaly detection in large datasets in which one detects…
We study the uniform asymptotics for the orthogonal polynomials with respect to weights composed of both absolutely continuous measure and discrete measure, by taking a special class of the sieved Pollazek Polynomials as an example. The…
Low-density parity-check codes with irregular constructions have been recently shown to outperform the most advanced error-correcting codes to date. In this paper we apply methods of statistical physics to study the typical properties of…
Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…
It has been shown recently [10] that Cauchy transforms of orthogonal polynomials appear naturally in general correlation functions containing ratios of characteristic polynomials of random NxN Hermitian matrices. Our main goal is to…
An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…
Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM)…
Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear…
LDPC (Low Density Parity Check) codes are among the most powerful and widely adopted modern error correcting codes. The iterative decoding algorithms required for these codes involve high computational complexity and high processing…