Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

The ultra-reliable low-latency communication (URLLC) scenario beyond the fifth-generation mobile networks requires latency to shift from ms-level to ms-level while maintaining low packet error rates. Short block-length codes can reduce latency but suffer f ...

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

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 ...

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

The concept of soliton gas was introduced in 1971 by Zakharov as an infinite collection of weakly interacting solitons in the framework of Korteweg-de Vries (KdV) equation. In this theoretical construction of a diluted (rarefied) soliton gas, solitons with ...

SKIPTRAIN is a novel Decentralized Learning (DL) algorithm, which minimizes energy consumption in decentralized learning by strategically skipping some training rounds and substituting them with synchronization rounds. These trainingsilent periods, besides ...

This limitation is circumvented by using scalable and non–memory–intensive harmonic expansions. In this paper, the projection of parametric surfaces onto disk and spherical harmonics bases is investigated, and three novel computationally efficient algorith ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

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 ...

Alzheimer's disease (AD) pathological changes may begin up to decades earlier than the appearance of the first symptoms of cognitive decline. Subjective cognitive decline (SCD) could be the first pre-clinical sign of possible AD, which might be followed by ...

Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels and are conjectured to have a comparable performance to that of random codes in terms of scaling laws. However, such results are established assuming maximum- ...

Superionics are fascinating materials displaying both solid- and liquid-like characteristics: as solids, they respond elastically to shear stress; as liquids, they display fast-ion diffusion at normal conditions. In addition to such scientific interest, su ...

Many photonic and electronic molecular properties, as well as chemical and biochemical reactivities are controlled by fast intramolecular vibrational energy redistribution (IVR). This fundamental ultrafast process limits coherence time in applications from ...

This study compares three imputation methods applied to the field observations of hydraulic head in subsurface hydrology. Hydrogeological studies that analyze the timeseries of groundwater elevations often face issues with missing data that may mislead bot ...

Background:Short-term forecasts of infectious disease burden can contribute to situational awareness and aid capacity planning. Based on best practice in other fields and recent insights in infectious disease epidemiology, one can maximise the predictive p ...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

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 ...

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 ...

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Chattez avec Graph Search

Turbo Product Code-aided Spatiotemporal 2-d Coded Mimo for Urllc

The Cost of Consistency: Submodular Maximization with Constant Recourse

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

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Soliton gas: Theory, numerics, and experiments

Energy-Aware Decentralized Learning with Intermittent Model Training

On the conjugate symmetry and sparsity of the harmonic decomposition of parametric surfaces with the randomised Kaczmarz method

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

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

Degradation of EEG microstates patterns in subjective cognitive decline and mild cognitive impairment: Early biomarkers along the Alzheimer's Disease continuum?

Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes

Solids that are also liquids: elastic tensors of superionic materials

Antenna-coupled infrared nanospectroscopy of intramolecular vibrational interaction

Comparison of Three Imputation Methods for Groundwater Level Timeseries

Predictive performance of multi-model ensemble forecasts of COVID-19 across European nations

Maximum Independent Set: Self-Training through Dynamic Programming

Symmetry in design and decoding of polar-like codes

Optima Age Over Erasure Channels

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity