Publication

Fountain codes for piecewise stationary channels

Related publications (109)

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.

Probabilistic base calling of Solexa sequencing data

Felix Naef, Jacques Rougemont, Christian Iseli, Arnaud Amzallag, Ioannis Xenarios

BACKGROUND: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA colonies. The processing and statistical analysis of such high-throughput dat ...

BioMed Central2008

Reliability of computational science

Fabio Nobile

Today's computers allow us to simulate large, complex physical problems. Many times the mathematical models describing such problems are based on a relatively small amount of available information such as experimental measurements. The question arises whet ...

Wiley-Blackwell2007

Capacity upper bounds for the deletion channel

Suhas Diggavi, Henry Pfister

We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ...

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

New model for rigorous analysis of LT-codes

Mohammad Amin Shokrollahi

We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting bit-error probability as the length o ...

2006

Fountain Codes for the Slepian-Wolf Problem

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

2006

A tutorial on (Bayesian) probability

Claudio Mattiussi

The aim of this tutorial is to show that, when properly formulated, probability theory is simply the science of plausible reasoning, which permits us to represent exactly and to update our state of information about the world. This is nothing new, since in ...

2005

Correlation between modulation and structural disorder in the 4,4 '-diethoxyazoxybenzene

Gervais Chapuis, Philip Pattison

The structural refinement of the modulated phase of 4,4'-Diethoxyazoxybenzene (DXB) indicates a correlation between the shifts on the DXB molecule (modulation) and the probability to find the azoxy (N --> O) group in different configurations (disorder). Th ...

2004

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...

2004

GA optimization of terminal antennas by the estimation of the population density of probability using dependency trees

Anja Skrivervik, Francisco Jesus Nunez

An application to antenna optimization of bayesian network density of probability estimators is presented. This technique is very usefull for optimizations where abig number of parameters, multiple solutions and local minima increase the likelihood to conv ...

2004

Reliability and latency in binary communication

Emre Telatar, Aslan Tchamkerten

The transmission of one of two messages over a binary symmetric channels with perfect and instantaneous feedback is considered. We study the situation where transmitter and receiver want to communicated reliably and quickly. We propose a simple decoding ru ...

2003