Publication
An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
Related publications (38)
Ultra-High-Throughput EMS NB-LDPC Decoder with Full-Parallel Node Processing
This paper presents an ultra-high-throughput decoder architecture for NB-LDPC codes based on the Hybrid Extended Min-Sum algorithm. We introduce a new processing block that updates a check node and its associated variable nodes in a fully pipelined way, th ...
SPRINGER2022Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity
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 ...
SIAM PUBLICATIONS2022From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality
In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...
EPFL2019New Results On The Pseudoredundancy
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...
2019Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pascal Giard
Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been ...
Ieee2017Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders
Alexios Konstantinos Balatsoukas Stimming
The goal of channel coding is to detect and correct errors that appear during the transmission of information. In the past few decades, channel coding has become an integral part of most communications standards as it improves the energy-efficiency of tran ...
EPFL2016The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion
The main objective of this paper is to explore the precise relationship between the Bethe free energy (or entropy) and the Shannon conditional entropy of graphical error correcting codes. The main result shows that the Bethe free energy associated with a l ...
Ieee-Inst Electrical Electronics Engineers Inc2016Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage
Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming
We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently ...
Institute of Electrical and Electronics Engineers2014EXIT-based Side Information Refinement in Wyner-Ziv Video Coding
The accuracy of the side information (SI) is critical in the performance of distributed video coding algorithms. The SI is typically built at a decoder based on the reconstructed data and on channel coding parity bits transmitted by the encoder. The optima ...
Institute of Electrical and Electronics Engineers2014Generalized Codes on Graphs and Applications in Content Distribution
The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...
EPFL2013