Optimisation - statistic analise of input code

[kamil-kielczewski]

Optimisation - lets analyse which characters are most used in input code - and base on that prepare proper map base4 to jsf (look to #1) - in this case decompresor shoud be constructed in dynamic way (or we can have hardcoded 4! permutations) - but the main decision is: which num for shortes representations is better 1 or 0, and sequenc for two larger representation 2,3 - so we need 4 decompresor variants (this also can play important rule if base8 will be shorter #6)