Concept

Codage de Huffman

Publications associées (191)

Vector Network Coding Algorithms

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

2010

Analysis of pulse modulation format in coded BOTDA sensors

Marcelo Alfonso Soto Hernandez

A theoretical and experimental analysis of the impact of pulse modulation format on Brillouin optical time-domain analysis (BOTDA) sensors using pulse coding techniques has been carried out. Pulse coding with conventional non-return-to-zero (NRZ) modulatio ...

Optical Society of America2010

Recursive Implementation of the Distributed Karhunen-Loeve Transform

Michael Christoph Gastpar

In the distributed linear source coding problem, a set of distributed sensors observe subsets of a data vector with noise, and provide the fusion center linearly encoded data. The goal is to determine the encoding matrix of each sensor such that the fusion ...

2010

Motion Estimation from Compressed Linear Measurements

Pascal Frossard, Vijayaraghavan Thirumalai

This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that describes the relative motion between images by translational motion of visual f ...

2010

RVC-CAL dataflow implementations of MPEG AVC/H.264 CABAC decoding

Marco Mattavelli, Endri Bezati

This paper describes the implementation of the MPEG AVC CABAC entropy decoder using the RVC-CAL dataflow programming language. CABAC is the Context based Adaptive Binary Arithmetic Coding entropy decoder that is used by the MPEG AVC/H.264 main and high pro ...

2010

Symmetric LDPC codes are not necessarily locally testable

Ghid Maatouk

Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known that a code must be a "low-density parity check" (LDPC) code for it to be loca ...

2010

Subjective Evaluation of Next-Generation Video Compression Algorithms: A Case Study

Touradj Ebrahimi, Francesca De Simone, Jong Seok Lee, Lutz Goldmann

This paper describes the details and the results of the subjective quality evaluation performed at EPFL, as a contribution to the effort of the Joint Collaborative Team on Video Coding (JCT-VC) for the definition of the next-generation video coding standar ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

Arithmetic Coding of Sub-Band Residuals in FDLP Speech/Audio Codec

Petr Motlicek, Hynek Hermansky, Sriram Ganapathy

A speech/audio codec based on Frequency Domain Linear Prediction (FDLP) exploits auto-regressive modeling to approximate instantaneous energy in critical frequency sub-bands of relatively long input segments. The current version of the FDLP codec operating ...

ISCA 20092009

DISTRIBUTED VIDEO CODING: TRENDS AND PERSPECTIVES

Frédéric Dufaux, Wen Gao

This paper surveys recent trends and perspectives in distributed video coding. More specifically, issues such as coding efficiency, error resilience, multi-view coding, scalability, and applications beyond coding are overviewed. In addition, recent contrib ...

Hindawi Publishing Corporation2009

Delay with network coding and feedback

Christina Fragouli, Lorenzo Keller

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of μ messages to several receivers over separate erasure channels. The sender can broad- cast a single message or ...

2009

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