Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC
Email/Printer Friendly Format  
 

Separation Theorems And Partial Orderings For Sensor Network Problems
Gastpar, M.  
Univ. of California, Berkeley;

This paper appears in: Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on
Publication Date: 4-7 Nov. 2007
On page(s): 374-375
Location: Pacific Grove, CA,
ISSN: 1058-6393
ISBN: 978-1-4244-2109-1
INSPEC Accession Number: 9941529
Digital Object Identifier: 10.1109/ACSSC.2007.4487233
Current Version Published: 2008-04-11

Abstract
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 (1948) 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.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not logged in.
Guests may access Abstract records free of charge.
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
Full Text: PDF (131 KB)
» Buy this document now
»  Learn more about
»  Learn more about
    purchasing articles
    and standards

Rights and Permissions
» Learn More
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2010 IEEE – All Rights Reserved