Publication

A Simple Converse of Burnashev's Reliability Function

Publications associées (43)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Effects of ‘Spatialized’ Communication in Tightly Coupled Work

Pierre Dillenbourg, Mauro Cherubini

This technical report describes the advancements on our research on collaborative annotations of maps. Particularly, we are trying to answer the following research question: does making explicit the location references of the elements of a discourse enhanc ...

2006

Achievable error exponents in multiterminal source coding

Michael Christoph Gastpar

Encoding correlated sources at separate encoders has been studied extensively from the perspective of asymptotically long block codes. The associated error exponents are known for the case of lossless source coding. In this paper, we introduce a novel tech ...

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

Secure Data Communication in Mobile Ad Hoc Networks

Panagiotis Papadimitratos

We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose ...

2006

One-Step Conversion of Cellobiose to C6-Alcohols Using a Ruthenium Nanocluster Catalyst

Paul Joseph Dyson, Cheng Zhao, Ning Yan, Huizhen Liu

The one-step conversion of cellulose to C6-alcs. via green and energy efficient approaches has, as far as we are aware, not been reported. Such a process presents a considerable challenge, the two key problems being (1) finding a suitable solvent that diss ...

2006

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

Power, Spatio-Temporal Bandwidth, and Distortion in Large Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through an imperfect observation process. The sensors can communicate back to a central data collector over a noisy channel. The key pa- rameters i ...

Institute of Electrical and Electronics Engineers2005

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004

A lower bound to the scaling behavior of sensor networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through a noisy observation process. The sensors can communicate back to a data collector over a noisy channel. The key parameters in such a se ...

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

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Using RASTA in task independent TANDEM feature extraction

John David Scott Dines, Guillermo Aradilla

In this work, we investigate the use of RASTA filter in the TANDEM feature extraction method when trained with a task independent data. RASTA filter removes the linear distortion introduced by the communication channel which is demonstrated in a 18% relat ...

IDIAP2004