A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

Deep learning has achieved remarkable success in various challenging tasks such as generating images from natural language or engaging in lengthy conversations with humans. The success in practice stems from the ability to successfully train massive neural ...

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

We demonstrate that when power scaling occurs for an individual tree and in a forest, there is great resulting simplicity notwithstanding the underlying complexity characterizing the system over many size scales. Our scaling framework unifies seemingly dis ...

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...

In this paper, we present the first CMOS SPAD with performance comparable or better than that of the best custom SPADs, to date. The SPAD-based design, fully integrated in 180 nm CMOS technology, achieves a peak PDP of 55% at 480nm with a very broad spectr ...

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

Amorphous solids yield at a critical value Sigma(c) of the imposed stress Sigma through a dynamical phase transition. While sharp in athermal systems, the presence of thermal fluctuations leads to the rounding of the transition and thermally activated flow ...

The growing demands on compact and high-definition single-photon avalanche diode (SPAD) arrays have motivated researchers to explore pixel miniaturization techniques to achieve sub-10 μm pixels. The scaling of the SPAD pixel size has an impact on key perfo ...

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called po ...

Anyone who has ever broken a dish or a glass knows that the resulting fragments range from roughly the size of the object all the way down to indiscernibly small pieces: typical fragment size distributions of broken brittle materials follow a power law, an ...

Recently, a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and gen ...

We analyze about 200 naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned on the basis of statisti ...

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential function. We show, under mild conditions, that the potential fu ...

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A Theory of Finite-Width Neural Networks: Generalization, Scaling Laws, and the Loss Landscape

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Symmetry in design and decoding of polar-like codes

Optima Age Over Erasure Channels

Seeing the forest for the trees through metabolic scaling

On the Efficiency of Polar-Like Decoding for Symmetric Codes

A Low-noise CMOS SPAD Pixel with 12.1 ps SPTR and 3 ns Dead Time

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

Thermally activated flow in models of amorphous solids

A Scaling Law for SPAD Pixel Miniaturization

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding

Explosive fragmentation of Prince Rupert's drops leads to well-defined fragment sizes

Adaptive Path Interpolation Method for Sparse Systems: Application to a Censored Block Model

True scale-free networks hidden by finite size effects

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

On the Universality of Low-Density Parity-Check Block Codes

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Displacement Convexity in Spatially Coupled Scalar Recursions