On the Universality of Low-Density Parity-Check Block 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.

Signal recovery under generative neural network priors has emerged as a promising direction in statistical inference and computational imaging. Theoretical analysis of reconstruction algorithms under generative priors is, however, challenging. For generati ...

The cerebellum is thought to help detect and correct errors between intended and executed commands(1,2) and is critical for social behaviours, cognition and emotion 3 Computations for motor control must be performed quicklyto correct errors in real time an ...

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

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding ...

There is an increasing interest in a fast-growing machine learning technique called Federated Learning (FL), in which the model training is distributed over mobile user equipment (UEs), exploiting UEs' local computation and training data. Despite its advan ...

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

LoRaWAN is a low-power wireless technology that provides long-range connectivity to battery-powered Internet of Things (IoT) devices. To minimize the energy consumption of the IoT nodes, LoRaWAN networks use for the uplink a pure non-slotted ALOHA multiple ...

We start this short note by introducing two remarkable mathematical objects: the E8E8 root lattice Lambda8Lambda8 in 8-dimensional Euclidean space and the Leech lattice Lambda24Lambda24 in 24-dimensional space. These two lattices stand out among their lat ...

We strengthen the results from a recent work by the second author, achieving bounds on the weight distribution of binary linear codes that are successful under block-MAP (as well as bit-MAP) decoding on the BEC. We conclude that a linear code that is succe ...

Design and verification of structures in modern codes of practice account for a safety format, ensuring that the probability of failure does not exceed a given threshold. Although specific safety formats are proposed in some cases for special types of stru ...

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

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

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

String sorting is a fundamental kernel of string matching and database index construction; yet, it has not been studied as extensively as fixed-length keys sorting. Because processing variable-length keys in hardware is challenging, it is no surprise that ...

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

Chat with Graph Search

Multi-layer State Evolution Under Random Convolutional Design

Structured cerebellar connectivity supports resilient pattern separation

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

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Federated Learning Over Wireless Networks: Convergence Analysis and Resource Allocation

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

Enhancing the Reliability of Dense LoRaWAN Networks With Multi-User Receivers

Almost impossible E_8 and Leech lattices

On Codes Decoding a Constant Fraction of Errors on the BSC

A consistent safety format and design approach for brittle systems and application to textile reinforced concrete structures

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

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

How Many CPU Cores is an FPGA Worth? Lessons Learned from Accelerating String Sorting on a CPU-FPGA System