Concept

Fountain code

Related publications (122)

Diversity Embedded Codes: Theory and Practice

Diversity embedded codes are high-rate space-time codes that have a high-diversity code embedded within them. They allow a form of communication where the high-rate code opportunistically takes advantage of good channel realizations while the embedded high ...

2008

Collaborative video streaming with Raptor network coding

Pascal Frossard, Nikolaos Thomos

We investigate the problem of collaborative video streaming with Raptor network coding over overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes to increase the overall throughput and improve the ...

2008

Optimistic Erasure-Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic ...

2008

Diversity Embedded Space-Time Codes

Suhas Diggavi, Sanket Dusad

Rate and diversity impose a fundamental trade-off in wireless communication. High-rate space-time codes come at a cost of lower reliability (diversity), and high reliability (diversity) implies a lower rate. However, wireless networks need to support appli ...

2008

Network-Coded Broadcast: from Canonical Networks to Random Topologies

Christina Fragouli, Jörg Widmer

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

2008

Fountain Capacity

Emre Telatar

Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventi ...

2007

Rateless coding with partial CSI at the decoder

Michael Christoph Gastpar

A channel model for channels with unknown state and partial state information available causally at the decoder is proposed. The model is based on arbitrarily varying channels (AVCs), and the partial state information is characterized by allowing the decod ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Robust Transmission of Multi-View Video Streams Using Flexible Macroblock Ordering and Systematic LT codes

Nikolaos Thomos, Erdal Arikan

The transmission of fully compatible H.264/AVC multi-view video coded streams over packet erasure networks is examined. Macroblock classification into unequally important slice groups is considered using the flexible macroblock ordering (FMO) tool of H.264 ...

2007

Network Coding Applications

Christina Fragouli, Emina Soljanin

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial deals with wireless and content di ...

2007

Cryptography based on error correcting codes

Lorenz Minder

The idea to use error-correcting codes in order to construct public key cryptosystems was published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa codes, but various later publications suggested the use of different familie ...

EPFL2007

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.