Question about Shannon's mathematics

  • Context: Graduate 
  • Thread starter Thread starter ScarTissue
  • Start date Start date
  • Tags Tags
    Mathematics
Click For Summary
SUMMARY

This discussion centers on Claude Shannon's paper "A Mathematical Theory of Communication," specifically the equation for channel capacity in discrete noiseless systems. The equation states that the number of sequences of duration t, represented as N(t), equals the sum of sequences ending in each symbol S1, S2, ..., Sn. Participants clarify that the equation correctly counts only t-length sequences, addressing concerns about potential double counting of sequences. The consensus is that Shannon's formulation is intentional and accurate, emphasizing the importance of focusing on the specific sequences being counted.

PREREQUISITES
  • Understanding of information theory concepts, particularly channel capacity.
  • Familiarity with Claude Shannon's contributions to communication theory.
  • Basic knowledge of discrete mathematics and sequences.
  • Ability to interpret mathematical equations and their implications in theoretical contexts.
NEXT STEPS
  • Study the implications of Shannon's equation on channel capacity in information theory.
  • Explore the concept of sequence counting in discrete systems.
  • Investigate other works by Claude Shannon to gain deeper insights into his theories.
  • Learn about applications of Shannon's theories in modern digital communication systems.
USEFUL FOR

Students of information theory, mathematicians, and professionals in telecommunications seeking to deepen their understanding of Shannon's work and its relevance to modern communication systems.

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?
 
Physics 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.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
10K