Sciweavers

9 search results - page 1 / 2
» Low-density graph codes that are optimal for source channel ...
Sort
View
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 11 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
2004
Springer
144views Education» more  CORR 2004»
13 years 11 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
TCOM
2008
117views more  TCOM 2008»
13 years 11 months ago
Nested turbo codes for the Costa problem
Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has la...
Yong Sun, Momin Uppal, Angelos D. Liveris, Samuel ...
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 8 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
SECON
2007
IEEE
14 years 5 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha