Achievable rates for multiple descriptions

Abstract

Consider a sequence of independent identically distributed where I(.) denotes Shannon mutual information. These rates are shown to be optimal for deterministic distortion measures.

DOI: 10.1109/TIT.1982.1056588

Extracted Key Phrases

Showing 1-8 of 8 references

A proof of Marton's coding theorem for the discrete memoryless broadcast channel

  • A Gamal, E Van Der Meulen
  • 1981

On a source coding problem with two channels and three receivers

  • L Ozarow
  • 1980

On source networks with minimal breakdown degradation

  • H Witsenhausen
  • 1980

Source coding for multiple descriptions

  • J Wolf, A Wyner, J Ziv
  • 1980

Source coding for multiple descriptions II: A binary source

  • H S Witsenhausen, A D Wyner
  • 1980

Rate Distortion Theory

  • T Berger
  • 1971

Information Theory and Reliable Communication

  • R Gallager
  • 1968

Coding theorems for a discrete source with a fidelity criterion

  • C E Shannon
  • 1959
Showing 1-10 of 339 extracted citations

Statistics

020406080'91'94'97'00'03'06'09'12'15
Citations per Year

636 Citations

Semantic Scholar estimates that this publication has received between 524 and 773 citations based on the available data.

See our FAQ for additional information.