4 ms·
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
by nico 3y ago
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… ))
- AnimalMuppet 3y agoSorry 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).
- nico 3y agoYes, however, the moment you choose a message size, there is always only a finite set of ways to arrange the symbols in those positions