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

Asymptotic and finite-length analysis of low-density parity-check codes

Changyan Di

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

EPFL2004

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

Optimal Estimator-Detector Receivers for Space-Time Block Coding

Olivier Roy

Most space-time coding schemes can be classified either as non-coherent (decoding is performed without forming an explicit channel estimate) or coherent (decoding is performed conditioned upon a channel estimate as if it were the actual channel realisation ...

2004

Optimal Estimator-Detector Receivers for Space-Time Block Coding

Olivier Roy

2004

Noisy Text Categorization

Alessandro Vinciarelli

This work presents a system for the categorization of noisy texts. By noisy it is meant any text obtained through an extraction process (affected by errors) from media different than digital texts. We show that, even with an average Word Error Rate of arou ...

2004

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 ...

IDIAP2004

Noisy Text Clustering

David Grangier, Alessandro Vinciarelli

This work presents document clustering experiments performed over noisy texts (i.e. text that have been extracted through an automatic process like speech or character recognition). The effect of recognition errors on different clustering techniques is mea ...

IDIAP2004

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

To code or not to code: lossy source-channel communication revisited

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

What makes a source–channel communication system optimal? It is shown that in order to achieve an optimal cost–distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distri ...

2003

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Rüdiger Urbanke, Abdelaziz Amraoui

In this paper we investigate the behaviour of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called "waterfall region". We show that, according to a simplified model, the performance curves in this region follo ...

2003