Publication

Capacity upper bounds for the deletion channel

Related publications (33)

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.

Multitype Contact Process on Z: Extinction and Interface

Daniel Rodrigues Valesin

We consider a two-type contact process on Z in which both types have equal finite range and supercritical infection rate. We show that a given type becomes extinct with probability 1 if and only if, in the initial configuration, it is confined to a finite ...

2010

Variance stabilizing transformations for meta-analysis of binary data

Philippe Vuistiner

The binary data are often used in the medical field or in social sciences to study an effect between two groups. It can be for example the effect of a treatment between a treated and a control group. The outcome will be the number of successes and the tota ...

2010

Valuation of electricity swing options by multistage stochastic programming

Daniel Kuhn

Electricity swing options are Bermudan-style path-dependent derivatives on electrical energy. We consider an electricity market driven by several exogenous risk factors and formulate the pricing problem for a class of swing option contracts with energy and ...

Elsevier2009

Numerical analysis of optimization-constrained differential equations

Chantal Landry

The modeling of a system composed by a gas phase and organic aerosol particles, and its numerical resolution are studied. The gas-aerosol system is modeled by ordinary differential equations coupled with a mixed-constrained optimization problem. This coupl ...

EPFL2009

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We introduce the key scaling concept of intensity; informally, the expected number of transitions per object per time ...

2008

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We consider the case where the number of transitions per time slot per object vanishes as

N

grows. We show that, ...

2008

A quasi-dynamic capacity constrained frequency-based transit assignment model

This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...

Elsevier2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

Approximating the Gaussian multiple description rate region under symmetric distortion constraints

Suhas Diggavi

We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints. One of the main contributions is a novel lower bound on the sum rate, derived by generalizing Ozarow’s well-k ...

2008

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

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

N

grows. We show that, ...

2008