Displacement Convexity - A Useful Framework for the Study of Spatially Coupled 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 ...

In a collaboration between Ecole Polytechnique Fédérale de Lausanne (EPFL) and CEA, in the fall of 2020, the experimental Programme d’Étude en Transmission de l’Acier Lourd et ses Eléments (PETALE) was successfully carried out in the CROCUS reactor of EPFL ...

As an emerging technology in the era of Industry 4.0, digital twin is gaining unprecedented attention because of its promise to further optimize process design, quality control, health monitoring, decision- and policy-making, and more, by comprehensively m ...

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

Physics-informed machine learning (PIML) is a set of methods and tools that systematically integrate machine learning (ML) algorithms with physical constraints and abstract mathematical models developed in scientific and engineering domains. As opposed to ...

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

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

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

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

Modeling in neuroscience occurs at the intersection of different points of view and approaches. Typically, hypothesis-driven modeling brings a question into focus so that a model is constructed to investigate a specific hypothesis about how the system work ...

As an emerging technology in the era of Industry 4.0, digital twin is gaining unprecedented attention because of its promise to further optimize process design, quality control, health monitoring, decision and policy making, and more, by comprehensively mo ...

In this thesis, we present a theory of value for the design and analysis of service ecosystems. The theory is based on general systems thinking. The concept of a system is used for relating knowledge from different disciplines (such as software engineering ...

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

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

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

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

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

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

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are gen ...

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

Chat with Graph Search

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

High-Resolution Modeling Without Computation Slowdown for PETALE in CROCUS

A comprehensive review of digital twin-part 2: roles of uncertainty quantification and optimization, a battery digital twin, and perspectives

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

Physics-Informed Machine Learning for Modeling and Control of Dynamical Systems

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Symmetry in design and decoding of polar-like codes

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Optima Age Over Erasure Channels

Combining hypothesis- and data-driven neuroscience modeling in FAIR workflows

A comprehensive review of digital twin - part 1: modeling and twinning enabling technologies

A Theory of Value for Service Ecosystems

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

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

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

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Displacement Convexity in Spatially Coupled Scalar Recursions

Reed-Muller codes polarize

Bits through Time