Re: A new lostless transformation algorithm

Combining the 3 types of strings is not necesary. We know the length of
each of them, so we can plac them one after another.

"It is not pure chaos. Pure Chaos would be to allow each of the 8
postions
to have any of 8 possible values."

The good thing about repeating symbols in the set is that it reduces
the size of permutation coding
The number of the permutations with repeating symbols is Pn = (sequence
length)! / Multiplextion(i=1,k) [number of symbols with value == i]

For example: 4 values: 1, 2, 1, 1 Pn = 4!/3! = 4 possible permmuions:
[1112, 1121, 1211, 2111]

.