I think you might be misreading the glob.
The 5,2,1 maps 5 letters to one byte (look at the mapping hash with Data::Dump), so I'm getting a 5 to 1 reduction.
(Ignoring the 2,1 which is just there for strings whose length is not a multiple of 5.)
I don't understand your use of 'chunks', or where you get 9 of them.
BTW: It's a 5 to 1 reduction independent of the redundancy in the string. Other compressors may use redundancy to do better. It's sort of
a question of how random the letters really are.
In reply to Re^3: How to efficently pack a string of 63 characters
by tybalt89
in thread How to efficently pack a string of 63 characters
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |