Channel Capacity

Günther Palm
Additional contact information
Günther Palm: University of Ulm, Neural Information Processing

Chapter Chapter 7 in Novelty, Information and Surprise, 2012, pp 89-95 from Springer

Abstract: Abstract In this chapter we extend the definitions of Chap. 5 to real information channels that handle sequences of symbols instead of single symbols. This extension is necessary to use the idea of taking a limit of very long sequences to define information rate (Definition 5.5) now to define transinformation rate and channel capacity. This leads to the proof of Shannon’s famous theorem in the next chapter.

Keywords: Computing Channel Capacity; Transinformation; Single Symbol; Famous Theorem; Information Channels (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-29075-6_7

Ordering information: This item can be ordered from
http://www.springer.com/9783642290756

DOI: 10.1007/978-3-642-29075-6_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().