Concept

Canal binaire symétrique

Publications associées (176)

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

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific fami ...

2005

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q is available with perfect (causal) feedback for communication. A recent result (A. Tchamkerten and I.E. Telatar) shows the existence, for certain families of channels (e.g. binar ...

2005

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

Error Control Schemes for On-chip Communication Links: the energy-reliability trade-off

Giovanni De Micheli, Luca Benini

On-chip interconnection networks for future systems on chip (SoC) will have to deal with the increasing sensitivity of global wires to noise sources such as crosstalk or power supply noise. Hence, transient delay and logic faults are likely to reduce the r ...

Institute of Electrical and Electronics Engineers2005

An information theory for erasure channels (invited paper)

Ramin Khalili

In this paper we present a rapid review of known results in the context of different scenario of the erasure channel. We will also give a converse capacity bound for relay channel showing that the cut-set bound is not attainable in general by any fixed cod ...

2005

Noisy Text Categorization

Alessandro Vinciarelli

This work presents categorization experiments performed over noisy texts. By noisy it is meant any text obtained through an extraction process (affected by errors) from media other than digital texts (e.g. transcriptions of speech recordings extracted with ...

2005

Conditional Bit Error Rate for an Impulse Radio UWB Channel with Interfering Users

Jean-Yves Le Boudec, Ruben Merz

We consider a multi-user impulse radio UWB physical layer in a multipath environment. We propose a fast and efficient method to compute the conditional bit error rate (BER), given some realizations of the channels from source/interferer to destination, and ...

2005

Capacity-approaching codes on the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel. The q-ary symmetric channel represents the next level of difficulty after the binary erasure channel (BEC). Since the channe ...

2004

Raptor codes on symmetric channels

Mohammad Amin Shokrollahi, Mehdi Molkaraie, Seyed Omid Etesami

This paper extends the construction and analysis of Raptor codes originally designed in A. Shokrollahi (2004) for the erasure channel to general symmetric channels. We explicitly calculate the asymptotic fraction of output nodes of degree one and two for c ...

2004

On the role of feedback in large sensor networks

Michael Christoph Gastpar

Feedback can considerably simplify the task of approaching and achieving the performance limits predicted by information theory. This paper determines some of the potential offered by feedback in a typical sensor network situation that could be termed moni ...

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