On Jul 14, 2018, at 2:18 PM, Joerg Sonnenberger <jo...@bec.de> wrote: > > On Fri, Jul 13, 2018 at 03:27:14PM -0600, Warren Young wrote: >> >> For example, 100 a’s requires a 7-bit run-length plus zero bits for our >> only code point > > You need more than zero bits to encode the original a though.
There’s only one letter in this alphabet, so all we need is a run length to say how many of them there are in our message. Another way to look at it is that a bit encodes one of two states, but we only have one state in this example, so we don’t need a whole bit to encode it. If the example were a’s or no-a’s, then you’d have two states, and thus need to encode it with bits. But materially, that’s no different from an a’s or b’s system, which also requires one bit per state. _______________________________________________ fossil-users mailing list email@example.com http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users