Separation theorems and partial orderings for sensor network problems

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,


Published in:
Conference Record Of The Forty-First Asilomar Conference On Signals, Systems & Computers, Vols 1-5, 374-375
Presented at:
41st Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, Nov 04-07, 2007
Year:
2007
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-2109-1
Laboratories:




 Record created 2011-10-17, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)