pith. sign in

arxiv: 1810.01567 · v1 · pith:TX732C7Fnew · submitted 2018-10-03 · 💻 cs.IT · math.IT

Lattice-based Robust Distributed Source Coding

classification 💻 cs.IT math.IT
keywords codingapproachesdistributedlattice-basedlimitperformancerobustscheme
0
0 comments X
read the original abstract

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the information-theoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes has a performance loss of 0.5 bits relative to this limit.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.