We address the problem of distributed source coding using a practical and constructive approach 1], referred to as Distributed source coding using syndromes (DISCUS), with applications to sensor networks. We propose low complexity encoding and decoding methods based on linear codes, to achieve all points in the achievable rate region of Slepian-Wolf 2] problem. The extension of these concepts t...

Distributed Arithmetic Coding (DAC) proves to be an effective implementation of Slepian-Wolf Coding (SWC), especially for short data blocks. To study the property of DAC codewords, the author has proposed the concept of DAC codeword spectrum1. For equiprobable binary sources, the problem was formatted as solving a system of functional equations. Then, to calculate DAC codeword spectrum in gener...

Due to content-enriched sensing information and flexibility, Wireless Multimedia Sensor Network (WMSN) has a lot of potential applications. Low channel capacity, limited resource, correlation between sensing sources and uncertain factors make the design and optimization of WMSN challenging. In a densely deployed WMSN, there generally exist correlation and redundancy in the multimedia informatio...

Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-and-forward has shown that function...

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...

In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...

In the 1970’s Slepian and Wolf proved that lossless source coding without side information at the encoder may perform as well as encoding with side information at the encoder. Wyner and Ziv extended the result to establish ratedistortion bounds for lossy compression. This has been used to examine the problem of coding multiple correlated distributed sources. In distributed coding, source statis...