Publication

Correlation-Aware Reconstruction of Network Coded Sources

Publications associées (34)

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

Network coding of correlated data with approximate decoding

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

We consider the problem of distributed delivery of correlated data from sensors in ad hoc network topologies. We propose to use network coding in order to exploit the path diversity in the network for efficient delivery of the sensor information. We furthe ...

2010

Penetration Depth Method-Novel Real-Time Strategy for Evaluating Femoroacetabular Impingement

Daniel Thalmann, Ronan Boulic, Ehsan Arbabi

We introduce a new method for computerized real-time evaluation of femoroacetabular impingement (FM). In contrast to previously presented stress analyses, this method is based on two types of predictions of penetration depths for two rotating bodies: curvi ...

Wiley-Blackwell2010

Distributed Representation of Geometrically Correlated Images with Compressed Linear Measurements

Pascal Frossard, Vijayaraghavan Thirumalai

The distributed representation of correlated images is an important challenge in applications such as multi-view imaging in camera networks or low complexity video coding. This paper addresses the problem of distributed coding of images whose correlation i ...

2010

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

Consider transmission over a binary additive white gaussian noise channel using a fixed low-density parity check code. We consider the posterior measure over the code bits and the corresponding correlation between two codebits, averaged over the noise real ...

2009

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

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

Source and channel coding using Fountain codes

Bertrand Ndzana Ndzana

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

EPFL2009

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

Cryptanalysis of an E0-like Combiner with Memory

Serge Vaudenay, Yi Lu

In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output sequences (up to certain bits). An upper bound of the correlations is given, wh ...

2008

Channel coding and modulation based on chaotic systems

Slobodan Kozic

In this thesis, a new class of codes on graphs based on chaotic dynamical systems are proposed. In particular, trellis coded modulation and iteratively decodable codes on graphs are studied. The codes are designed by controlling symbolic dynamics of chaoti ...

EPFL2006

Conservation laws for coding

Cyril Measson

This work deals with coding systems based on sparse graph codes. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connec ...

EPFL2006