Toward Universal Belief Propagation Decoding for Short Binary 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.

We introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This fram ...

Background and objectives: Parameter estimation and uncertainty quantification are crucial in computa-tional cardiology, as they enable the construction of digital twins that faithfully replicate the behavior of physical patients. Many model parameters reg ...

Since polar were ratified as part of the 5G standard, low-complexity polar decoders with close-to-optimum error-rate performance have received significant attention. Compared to successive cancellation (SC) decoding, both SC list and SC flip decoding can i ...

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

Many scientific and engineering applications feature large-scale non-smooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the non-smooth objective is equipped with a ...

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...

The advent of statistical parametric speech synthesis has paved new ways to a unified framework for hidden Markov model (HMM) based text to speech synthesis (TTS) and automatic speech recognition (ASR). The techniques and advancements made in the field of ...

Concurrently exploring both algorithmic and architectural optimizations is a new design paradigm. This survey paper addresses the latest research and future perspectives on the simultaneous development of video coding, processing, and computing algorithms ...

This paper addresses the problem of efficiently delivering a layered media stream from multiple senders to a single receiver, over channels that present correlated packet loss patterns. Using a digital fountain approach, the performance of a distributed st ...

Toward Universal Belief Propagation Decoding for Short Binary Block Codes

Chat with Graph Search

Contextual Stochastic Bilevel Optimization

Fast and robust parameter estimation with uncertainty quantification for the cardiac function

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

Graph fragmentation problem: analysis and synthesis

An inexact proximal path-following algorithm for constrained convex minimization

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Unified Framework of Feature Based Adaptation for Statistical Speech Synthesis and Recognition

Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

Adaptive and robust media streaming over multiple channels with bursty losses