Publications related to Generalized Codes on Graphs and Applications in Content Distribution

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.

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

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

Andreas Peter Burg, Pascal Andreas Meinerzhagen, Georgios Karakonstantis, Andrea Bonetti

The area and power consumption of low-density parity check (LDPC) decoders are typically dominated by embedded memories. To alleviate such high memory costs, this paper exploits the fact that all internal memories of a LDPC decoder are frequently updated w ...

2015

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Simulation of the plasma profiles evolution for a tokamak discharge including time varying geometry

Olivier Sauter, Federico Alberto Alfredo Felici, Anna Teplukhina

Applications of the RApid Plasma Transport simulatOR (RAPTOR) for the simulation of the plasma tokamak parameters evolution are presented. The RAPTOR transport model has been extended by time varying terms and verified via comparisons with ASTRA simulation ...

2015

LLR-Based Successive Cancellation List Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in su ...

Institute of Electrical and Electronics Engineers2015

Online Fountain Codes With Low Overhead

Mohammad Amin Shokrollahi, Yuval Cassuto

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formaliz ...

Institute of Electrical and Electronics Engineers2015

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Generalized Codes on Graphs and Applications in Content Distribution

Graph Chatbot

Chat with Graph Search

Re-proving Channel Polarization Theorems

Sparse Probabilistic Models

Secure Network Coding With Erasures and Feedback

Asynchronous Decoding of LDPC Codes over BEC

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Simulation of the plasma profiles evolution for a tokamak discharge including time varying geometry

LLR-Based Successive Cancellation List Decoding of Polar Codes

Online Fountain Codes With Low Overhead

LDPC Codes for 2D Arrays

Re-proving Channel Polarization Theorems

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Online Fountain Codes With Low Overhead

LDPC Codes for 2D Arrays

Secure Network Coding With Erasures and Feedback

Sparse Probabilistic Models

Asynchronous Decoding of LDPC Codes over BEC

Simulation of the plasma profiles evolution for a tokamak discharge including time varying geometry

LLR-Based Successive Cancellation List Decoding of Polar Codes