In this installment I demonstrate how to determine some of the quantities we have been looking into using Mathematica 8. You can find it at this website:
http://www.madscitech.org/csg/it.html
under Information Theory V.
An exploration of theoretical physics, for those who are not necessarily PhDs, but who don't want their physics dumbed-down.
Showing posts with label Statistical Mechanics. Show all posts
Showing posts with label Statistical Mechanics. Show all posts
Thursday, June 28, 2012
Sunday, June 17, 2012
The Nature of Information IV
In this post I examine what coding is and introduce Shannon's First Coding Theorem and the Shannon-McMillan Theorem. See Information Theory IV.
Wednesday, June 13, 2012
The Nature of information III
In this posting I explore the probability of finding strings and establish the principle that the chace of finding a given string is independent from the elements of the string. This result is called the Asymptotic Equipartition Property. For details go to the The Nature of Information III
Friday, May 18, 2012
The Nature of information
The Nature of Information
George Hrabovsky
MAST
Introduction
Information can be thought of as what we do not already know. We acquire information when we learn, or perhaps it is that the act of learning is acquiring information. In either case we can consider infomration in the abstract to be a phsycial quantity and it can be measured.
Bits
How do we measure information? Like any measurement of a physical quantity we choose a fundamental unit. Then we say that something has a quantity of units, a numerical result. Something can be five meters long, or it can be 4.3 pounds of weight, or 6.1 kilograms of mass, and so on. For information we use the bit as a fundamental quantity. Thus we can say that some information is composed of a number of bits.
Characterizing Information
We will use symbols to represent bits of information. A set of symbols comprising a single bit will be represented by
two bits by
and so on, so that a set of n such symbols is the sequence
.
Schemes
If we also associate a probability that a given symbol will be sent,
The symbols of such a set must be mutually exclusive, so that the total of all probabilies is 1. We can combine them into a single symbol,
This is called a finite scheme.
Entropy
Entropy is, among other things, the measure of the disorder of a system of symbols. In the case of a scheme the entropy is given by,
We will discuss these things in more detail later.
Thursday, May 17, 2012
A New Inquiry—Information Theory
Diving into Information Theory
I have begun to delve into the mysteries of information theory. I plan to post the results here. I cannot predict where it will lead, but it will be great fun. For now I plan the following:
1) The nature of information.
2) Channel capacity.
3) Gaussian channels.
4) Fisher information.
5) The thermodynamics of information.
6) The statistical mechanics of information.
7) Ergodic sources.
8) Entropy
9) Detecting information.
10) Measure of information.
11) Encoding.
12) Noiseless coding.
13) Discrete channels.
14) Error-correcting codes.
15) Channels with memory.
16) Continuous channels.
It is possible that I will get to quantum information and black holes.
I have begun to delve into the mysteries of information theory. I plan to post the results here. I cannot predict where it will lead, but it will be great fun. For now I plan the following:
1) The nature of information.
2) Channel capacity.
3) Gaussian channels.
4) Fisher information.
5) The thermodynamics of information.
6) The statistical mechanics of information.
7) Ergodic sources.
8) Entropy
9) Detecting information.
10) Measure of information.
11) Encoding.
12) Noiseless coding.
13) Discrete channels.
14) Error-correcting codes.
15) Channels with memory.
16) Continuous channels.
It is possible that I will get to quantum information and black holes.
Subscribe to:
Posts (Atom)





