Typical set

Publications associées (29)

Fountain Capacity

Emre Telatar

Fountain codes have been successfully employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This paper introduces the notion of fountain capacity for arbitrary channels, and shows that it is equal ...

2006

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

Power-bandwidth-distortion scaling laws for sensor networks

Martin Vetterli, Michael Christoph Gastpar

The goal of a class of sensor networks is to monitor an underlying physical reality at the highest possible fidelity. Sensors acquire noisy measurements and have to communicate them over a power- and possibly bandwidth-constrained interference channel to a ...

2004

Source-Channel Communication in Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts: First, the sensors compress their respective acquired signals, potentially applying the concepts of distributed source coding. Then ...

2003

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...

2002

The compound channel capacity of a class of finite-state channels

Emre Telatar

A transmitter and receiver need to be designed to guarantee reliable communication on any channel belonging to a given family of finite-state channels defined over common finite input, output, and state alphabets. Both the transmitter and receiver are assu ...

1998

Multiresolution broadcast for digital HDTV using joint source-channel coding

Martin Vetterli

The use of multiresolution (MR) joint source-channel coding in the context of digital terrestrial broadcasting of high-definition television (HDTV) is shown to be an efficient alternative to single-resolution techniques, which suffer from a sharp threshold ...

1993

Joint source/channel coding of statistically multiplexed real-time services on packet networks

Martin Vetterli

We investigate the interactionof congestion control with the partitioning of source information into components of varying importance for variable bit-rate packet voice and packet video. High-priority transport for the more important signal components resu ...

1993