pith. sign in

arxiv: 1402.2032 · v1 · pith:PYS2NZ3Onew · submitted 2014-02-10 · 💻 cs.IT · math.IT

An Achievable Rate-Distortion Region for the Multiple Descriptions Problem

classification 💻 cs.IT math.IT
keywords codingrate-distortionregionschemeachievableknownlinearrandom
0
0 comments X
read the original abstract

A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme achieves a larger rate-distortion region than previously known random coding strategies. Furthermore, it is shown via an example that the best known random coding scheme for the set-up can be improved by including additional randomly generated codebooks.

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.