Non-Asymptotic Performance of Symmetric Slepian-Wolf Coding
نویسندگان
چکیده
Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits put forth by information theory can be reached. Our contribution is two-fold. First, we investigate the non-asymptotic regime for two binary sources that generate sequences with a symmetric joint distribution. Second, we provide tight converse and achievable bounds and also show how to construct codes for any rate pair within the feasible rate region. The key result is that the feasible rate region for the non-asymptotic regime is obtained by translating the corresponding rate region for the asymptotic regime.
منابع مشابه
Approaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملMultiterminal Source Code Design Based on Slepian-Wolf coded quantization∗
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper presents two practical MT coding schemes under the same general framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect quadratic Gaussian MT source coding problems with two encoders. The first asymmetric SWCQ scheme relies on quantization and...
متن کاملDistributed arithmetic coding for the 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, 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...
متن کاملDistributed Source Coding: Symmetric Rates and Applications to Sensor Networks
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...
متن کاملRedundancy Rates of Slepian-Wolf Coding∗
The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in design of distributed source codes, along with the need for distributed compression in sensor networks, has made it crucial to understand how quickly distributed communication systems can approach their ultimate limits. Slepian and Wolf considered the distributed enco...
متن کامل