Concept

Low-density parity-check code

Related publications (416)

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

Ieee2017

Coding for Communications and Secrecy

Mani Bastaniparizi

Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...

EPFL2017

Simplex Queues for Hot-Data Download

Elie Najm, Emina Soljanin

In cloud storage systems, hot data is usually replicated over multiple disks/servers in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using avail ...

2017

PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Thomas Christoph Müller, Andrea Bonetti, Pascal Giard

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explici ...

2017

Numerical optimization of the ramp-down phase with the RAPTOR code

Olivier Sauter, Federico Alberto Alfredo Felici, Antoine Pierre Emmanuel Alexis Merle, Anna Teplukhina

The ramp-down optimization goal in this work is defined as the fastest possible decrease of a plasma current while avoiding any disruptions caused by reaching physical or technical limits. Numerical simulations and preliminary experiments on TCV and AUG ha ...

2017

High-Speed Wireline Link Design

Hazar Yüksel

High-speed serial links are a crucial application of semiconductor technology and have been the enabler of the scaling of computing systems. The increasing data-rate requirements of these links have only been partially satisfied by advancements in process ...

EPFL2017

Sparse Pronunciation Codes for Perceptual Phonetic Information Assessment

Hervé Bourlard, Milos Cernak, Afsaneh Asaei, Dhananjay Ram

Speech is a complex signal produced by a highly constrained articulation machinery. Neuro and psycholinguistic theories assert that speech can be decomposed into molecules of structured atoms. Although characterization of the atoms is controversial, the ex ...

2017

Timely Updates over an Erasure Channel

Elie Najm, Emina Soljanin

Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. %Coded redundancy is employed to ensure the timely delivery of codupdate packets. We start by deriving the averag ...

2017

On the Duality between Multiple-Access Codes and Computation Codes

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu

For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess s ...

2017

Okapi : Causally Consistent Geo-Replication Made Faster, Cheaper and More Available

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

Okapi is a new causally consistent geo-replicated key-value store. Okapi leverages two key design choices to achieve high performance. First, it relies on hybrid logical/physical clocks to achieve low latency even in the presence of clock skew. Second, Oka ...

2017

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.