Publication

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Related publications (118)

Graph Chatbot

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.

Multiuser Random Coding Techniques for Mismatched Decoding

Jonathan Mark Scarlett, Albert Guillén i Fàbregas

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensem ...

Institute of Electrical and Electronics Engineers2016

Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs

Rajai Nasser

We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the standard polar codes of Arikan and Reed-Muller codes. We derive a closed form ...

2016

Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs

Rajai Nasser

IEEE2016

High-Speed Link With Trellis-Coded Modulation and Reed Solomon Coding

Andreas Peter Burg, Thomas Toifl, Giovanni Cherubini

A high-performance low-latency transmission system based on a concatenated code consisting of inner four-dimensional five-level pulse-amplitude-modulation (5-PAM) trellis-coded modulation and an outer Reed-Solomon (RS) code is proposed for a high-speed dat ...

Ieee2016

Optimization of LPN Solving Algorithms

Serge Vaudenay, Sonia Mihaela Bogos

In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance, we make use of the existing techniques and optimize th ...

Springer-Verlag Berlin2016

Re-proving Channel Polarization Theorems

Mine Alsan

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Arikan proved that this class of codes, ...

EPFL2015

Sparse Probabilistic Models

Andrei Giurgiu

This thesis is concerned with a number of novel uses of spatial coupling, applied to a class of probabilistic graphical models. These models include error correcting codes, random constraint satisfaction problems (CSPs) and statistical physics models calle ...

EPFL2015

Secure Network Coding With Erasures and Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Scaling Exponent of List Decoders With Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff betwe ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Wave-Like Solutions of General 1-D Spatially Coupled Systems

Rüdiger Urbanke, Shrinivas Kudekar

We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a 1-D real-valued state. This is extended to a proof of the threshold saturation phenomenon for all such models, ...

Ieee-Inst Electrical Electronics Engineers Inc2015