Sciweavers

3750 search results - page 6 / 750
» Code Optimization for Code Compression
Sort
View
ISITA
2010
13 years 2 months ago
Optimality of LDGM-LDPC compound codes for lossy compression of binary erasure source
We consider the Binary Erasure Source (BES) introduced by Martinian and Yedidia. Based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion p...
Gregory Demay, Vishwambhar Rathi, Lars K. Rasmusse...
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
CASES
2006
ACM
14 years 1 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
DCC
2004
IEEE
14 years 7 months ago
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum
IR
2007
13 years 7 months ago
Lightweight natural language text compression
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...