Question about Shannon's mathematics

  • Thread starter Thread starter ScarTissue
  • Start date Start date
  • Tags Tags
    Mathematics
ScarTissue
Messages
7
Reaction score
0
I'm trying to go through Shannon's paper "A Mathematical Theory of Communication" to improve my understanding of information theory.

In Part I (Discrete Noiseless Systems) Shannon states:

Suppose all sequences of the symbols S1, . . . ,Sn are allowed and these symbols have durations t1, . . . ,tn. What is the channel capacity?
If N(t) represents the number of sequences of duration t we have

N(t) = N(t -t1)+N(t -t2)+...+N(t -tn):

The total number is equal to the sum of the numbers of sequences ending in S1, S2, . . . , Sn and these are N(t -t1), N(t -t2), . . . ,N(t -tn), respectively.


So I can't understand how this sum is actually working. For example, if t1=2s and t2=4s, then the first term in the sum is the number of all sequences ending in S1 as expected. However the second term is going to be the number of all sequences ending in either S1,S1 or S2. So this means that some of the sequences ending in S1 have been counted twice by this sum.

Am I missing something here? Or am I correct and the right hand side of the equation is going to be larger than the left?
 
Mathematics news on Phys.org
To get a sequence of duration t, we append some Si to a sequence of duration t - ti. N(t) is just the number of sequences of duration t, and is the sum of those with each Si to be appended.

-- sorry, I see I answered the wrong question. The question was, is the sum correct?
 
Last edited:
Yes, I understand what the terms mean (I think) but I don't see how the two sides of the equation are equal.
 
We know Claude Shannon as one of the forefathers of the digital age. Someone with this much foresight would not easily make a mistake. Whatever he wrote there we must assume was intentional.

Therefore, look again. And focus too on what is being counted. We are counting only t-length sequences, not any shorter sequences.

In reference to: "So this means that some of the sequences ending in S1 have been counted twice by this sum."

PS. Sorry for biting your head off.
 
Last edited:
We are counting only t-length sequences, not any shorter sequences.

Right. So if we have t1=2 and t2=4, any sequence ending in two S1's will have the same length as any sequence ending in one S2. In such a case you count the S1S1 sequences twice.

I don't believe Shannon could have made a mistake in this paper, and I don't believe it could have gone unquestioned if he had. So really I'm just trying to understand why you don't count the sequences above twice, or if you do, why it doesn't matter.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top