Shannon’s Source Coding Theorem (Foundations of Information Theory: Part 3)

Re:Shannon’s Source Coding Theorem (Foundations of Informati... by nico on Sunday June 18, 2023 @02:10PM (#36382714)

Yes, embarrassing mistake

Still 10 is less than 15

Additionally, as someone else pointed out, it would be 6^5 sequences, which would need 13 bits

Still 13 is less than 15

But the interesting thing is, you can then index the most commonly used sequences of sequences and compress by a few more bits

You can keep the process going until you have a 2 bit index for the most commonly used sequences (of sequences (of sequences… ))

[ Parent | on HN ]

Re:Shannon’s Source Coding Theorem (Foundations of Informati... by AnimalMuppet on Sunday June 18, 2023 @02:34PM (#36382948)

Sorry to keep nitpicking, but: In this case, you can't compress further. These are dice rolls; there aren't "most commonly used sequences" (if the dice are any good).

[ Parent | on HN ]

Re:Shannon’s Source Coding Theorem (Foundations of Informati... by nico on Sunday June 18, 2023 @04:39PM (#36384222)

Yes, however, the moment you choose a message size, there is always only a finite set of ways to arrange the symbols in those positions

[ Parent | on HN ]