Concept

Code de Hamming

Publications associées (226)

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

Towards using slide information to enhance speech transcription of meetings

Hervé Bourlard, Artem Peregoudov, Alessandro Vinciarelli

In this paper we investigate the possibility of improving the speech recognition performance of meeting recordings by using slides captured during the recording process. The key hypothesis exploited in this work is that both slides and speech carry correla ...

IDIAP2006

On Successive Refinement of Diversity for fading ISI channels

Suhas Diggavi, Sanket Dusad

Abstract—Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for IntersymbolInterference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that they ha ...

2006

On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes

Christina Fragouli, Urs Niesen

We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...

2005

Single and Multi-Hop ARQ in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...

2005

Locally Testable Codes

Mahdi Cheraghchi Bashi Astaneh

Error correcting codes are combinatorial objects that allow reliable recovery of information in presence of errors by cleverly augmenting the original information with a certain amount of redundancy. The availability of efficient means of error detection i ...

2005

Analysis of Error Recovery Schemes for Networks on Chips

Giovanni De Micheli, Luca Benini, Srinivasan Murali

In this article, we discuss design constraints to characterize efficient error recovery mechanisms for the NoC design environment. We explore error control mechanisms at the data link and network layers and present the schemes' architectural details. We in ...

Institute of Electrical and Electronics Engineers2005

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

LDPC codes for fading Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message updat ...

2005

Application of Information Retrieval Techniques to Single Writer Documents

Alessandro Vinciarelli

This work shows Information Retrieval experiments performed over handwritten documents produced by a single writer. The same retrieval task has been performed over both manual (no errors) and automatic (Word Error Rate around 45%) transcriptions of 200 han ...

2005

Packet Combining in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...

2005