Concept

Code de Hamming

Publications associées (226)

A Generative Model for Rhythms

Modeling music involves capturing long-term dependencies in time series, which has proved very difficult to achieve with traditional statistical methods. The same problem occurs when only considering rhythms. In this paper, we introduce a generative model ...

2007

A Generative Model for Rhythms

Samy Bengio, Jean-François Paiement

IDIAP2007

Analysis of distributed temperature sensing based on Raman scattering using OTDR coding and discrete Raman amplification

Marcelo Alfonso Soto Hernandez

The behaviour of distributed temperature sensors based on spontaneous Raman scattering and coded OTDR (optical time domain reflectometry) is studied both theoretically and experimentally; in particular a high performance scheme has been implemented using a ...

2007

Minimum Mutual Information Beamforming for Simultaneous Active Speakers

In this work, we consider an acoustic beamforming application where two speakers are simultaneously active. We construct one subband-domain beamformer in \emph{generalized sidelobe canceller} (GSC) configuration for each source. In contrast to normal pract ...

IDIAP2007

Adaptive Beamforming with a Minimum Mutual Information Criterion

IDIAP2007

Finite fields And Error-Correcting Codes

Nelly Burrin

After introducing the concept of finite fields and their properties, we look algebraic constructions of error correcting codes. ...

2006

On the relation between MAP and BP GEXIT functions of low density parity check codes

Nicolas Macris

We consider communication over binary input memoryless symmetric channels with low density parity check codes. The relationship between maximum a posteriori and belief propagation GEXIT functions is investigated using a set of correlation inequalities of s ...

2006

Weight Distribution of Low-Density Parity-Check Codes

Rüdiger Urbanke, Changyan Di

We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns ...

2006

Assessing the effectiveness of slides as a mean to improve the automatic transcription of oral presentations

Hervé Bourlard, Artem Peregoudov, Alessandro Vinciarelli

This paper presents experiments aiming at improving the automatic transcription of oral presentations through the inclusion of the slides in the recognition process. The experiments are performed over a data set of around three hours of material (~33 kword ...

IDIAP2006

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

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

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

n

and

k

, constru ...

2006