Logo

A Mathematical Theory of Communication

Large book cover: A Mathematical Theory of Communication

A Mathematical Theory of Communication
by


Number of pages: 79

Description:
The person who wrote this paper is the father of modern communication theory, Claude Shannon. In this seminal work Shannon presents results that were previously found nowhere else, and today many professors refer to it as the best exposition still on the subject of the mathematical limits on communication (such as bandwidth). Further, it laid the modern foundations for what is now coined Information Theory. Classic work.

Download or read it online for free here:
Download link
(4.4MB, PDF)

Similar books

Book cover: A primer on information theory, with applications to neuroscienceA primer on information theory, with applications to neuroscience
by - arXiv
This chapter is supposed to give a short introduction to the fundamentals of information theory, especially suited for people having a less firm background in mathematics and probability theory. The focus will be on neuroscientific topics.
(5263 views)
Book cover: Algorithmic Information TheoryAlgorithmic Information Theory
by - CWI
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain this quantitative approach to defining information and discuss the extent to which Kolmogorov's and Shannon's theory have a common purpose.
(6957 views)
Book cover: From Classical to Quantum Shannon TheoryFrom Classical to Quantum Shannon Theory
by - arXiv
The aim of this book is to develop 'from the ground up' many of the major developments in quantum Shannon theory. We study quantum mechanics for quantum information theory, we give important unit protocols of teleportation, super-dense coding, etc.
(6670 views)
Book cover: Around Kolmogorov Complexity: Basic Notions and ResultsAround Kolmogorov Complexity: Basic Notions and Results
by - arXiv.org
Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.
(2552 views)