(raht) wrote in message om...

Let me see if I can help a little?

take a line from the example

---ll---lll--l-----llll-llll------lll-lll-lllll-ll-ll-llll--ll---lll----l-ll--,

now break it into 3's (it's 3 bit binary)
--- ll- --l ll- -l- --- -ll ll- lll l-- --- -ll l-l ll- lll ll- ll-
ll- lll l-- ll- --l ll- --- l-l l--,

the - = 0
and l = 1


Interesting approach, raht. But just how did you figure out it was
3-bit binary in the first place? At first glance, since 3 bits allows
only for 8 possibilities, you'd need at least 5 bits to represent all
26 letters of the alphabet. So, at this point, why not 6 bits instead
of 3?

P.