Sciweavers

933 search results - page 17 / 187
» Robust Distributed Source Coding
Sort
View
ICIP
2007
IEEE
15 years 18 days ago
Overlapped Quasi-Arithmetic Codes for Distributed Video Coding
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...
Xavier Artigas, Simon Malinowski, Christine Guille...
IWPC
2009
IEEE
14 years 5 months ago
Natural language parsing for fact extraction from source code
We present a novel approach to extract structural information from source code using state-of-the-art parser technologies for natural languages. The parser technology is robust in...
Jens Nilsson, Welf Löwe, Johan Hall, Joakim N...
TIT
2008
89views more  TIT 2008»
13 years 10 months ago
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources
Abstract--The problem of joint universal source coding and density estimation is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For...
Maxim Raginsky
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 10 months ago
Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution
Turbo coding is a powerful class of error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-in...
Kim-Chi Nguyen, Gilles Van Assche, Nicolas J. Cerf
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 11 months ago
Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic codin...
Marco Grangetto, Enrico Magli, Gabriella Olmo