Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Separation theorems and partial orderings for sensor network problems
 
conference paper

Separation theorems and partial orderings for sensor network problems

Gastpar, Michael  
2007
Conference Record Of The Forty-First Asilomar Conference On Signals, Systems & Computers
41st Asilomar Conference on Signals, Systems and Computers

In the absence of complexity and delay constraints, the quality of a noisy communication channel can be characterized by a single number, called its capacity and usually measured in bits. Shannon [1] showed that this number is universal in the sense that via the so-called source/channel separation theorem, it applies to all (stationary, ergodic) communication problems, making bits the universal currency of information in point-to-point communication. More explicitly, the potential offered by a noisy communication channel is fully characterized by its capacity, and the difficulty of communicating a source (in general, with respect to a distortion criterion) is fully characterized by its rate-distortion function.

  • Details
  • Metrics
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés