Concept

Fountain code

Related publications (122)

FudgeFactor: Syntax-Guided Synthesis for Accurate RTL Error Localization and Correction

Paolo Ienne, Barbara Jobstmann, David Novo Bruna, Andrew James Becker, Mohsen A A Ewaida

Functional verification occupies a significant amount of the digital circuit design cycle. In this paper, we present a novel approach to improve circuit debugging which not only localizes errors with high confidence, but can also provide semantically-meani ...

Springer2015

XOR-Based Encoding With Instantaneous Decoding for the Broadcast Erasure Channel With Feedback: The Three-User Case

We study the case of a three-user broadcast erasure channel with multiple unicast traffic sessions, where feedback from the users is fed back to the transmitter in the form of positive acknowledgment (ACK)/negative acknowledgment (NACK) messages. The capac ...

Institute of Electrical and Electronics Engineers2014

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014

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

Growth Codes: Intermediate Performance Analysis and Application to Video

Pascal Frossard, Nikolaos Thomos, Rethnakaran Pulikkoonattu

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly usef ...

Institute of Electrical and Electronics Engineers2013

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

New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in effici ...

2013

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 links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

2013

Polarization and Spatial Coupling

Seyed Hamed Hassani

During the last two decades we have witnessed considerable activity in building bridges between the fields of information theory/communications, computer science, and statistical physics. This is due to the realization that many fundamental concepts and no ...

EPFL2013

Polar Codes For Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important ...

2013

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.