Publications related to Efficient erasure correcting 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.

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Pierre Vandergheynst, Kirell Maël Benzi, Benjamin Ricaud

Graphs are now ubiquitous in almost every field of research. Recently, new research areas devoted to the analysis of graphs and data associated to their vertices have emerged. Focusing on dynamical processes, we propose a fast, robust and scalable framewor ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Optimal Computational Split-state Non-malleable Codes

Divesh Aggarwal, Divya Gupta

Non-malleable codes are a generalization of classical error-correcting codes where the act of "corrupting" a codeword is replaced by a "tampering" adversary. Non-malleable codes guarantee that the message contained in the tampered codeword is either the or ...

Springer Int Publishing Ag2016

Partitioned Successive-Cancellation List Decoding Of Polar Codes

Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a ...

Ieee2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

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

Efficient erasure correcting codes

Graph Chatbot

Chat with Graph Search

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Optimal Computational Split-state Non-malleable Codes

Partitioned Successive-Cancellation List Decoding Of Polar Codes

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

LLR-Based Successive Cancellation List Decoding of Polar Codes

Non-malleable Reductions and Applications

Online Fountain Codes With Low Overhead

Independence number of generalized Petersen graphs

Optimal Computational Split-state Non-malleable Codes

Scaling a Reliable Distributed System

Partitioned Successive-Cancellation List Decoding Of Polar Codes

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Non-malleable Reductions and Applications

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

Online Fountain Codes With Low Overhead

LLR-Based Successive Cancellation List Decoding of Polar Codes