Near sufficiency of random coding for two descriptions

@article{LastrasMontao2006NearSO,
  title={Near sufficiency of random coding for two descriptions},
  author={Luis Alfonso Lastras-Monta{\~n}o and Vittorio Castelli},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={681-695}
}
We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded and the desired distortion levels. Variants of our basic ideas are presented, including upper and… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS