Sciweavers

5 search results - page 1 / 1
» Low-density constructions can achieve the Wyner-Ziv and Gelf...
Sort
View
CORR
2006
Springer
81views Education» more  CORR 2006»
13 years 4 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 4 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
CORR
2006
Springer
81views Education» more  CORR 2006»
13 years 4 months ago
Low density codes achieve the rate-distortion bound
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a...
Emin Martinian, Martin J. Wainwright
TSP
2011
106views more  TSP 2011»
12 years 11 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 4 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi