the idea is
1.treat input file as bit consequence width L.
2.shift M bits to the right and search for inclusions L-M subconsequence in L.
3.(L-M)*N=universal compression profit for N inclusions of L-M subconsequence...
4.create unique substitution of L-M width K. (L-M-K)*N= real profit...
5.sort all L,M,N,K for maximum of function (L-M-K)*N...
6.create unique L-M header consists of L-M consequence and K substitution.
7.write out new file with L-M header and N substitutions with sequence K.
8. check is any existence of M,N,K possible?
9.goto 1 if yes and end of algo if not!
step 4,5,6,8,9 made by hands...
it is dirty description but idea is clear, i hope!
please tell me was this method made before?
i did realization in code partelly in 2005 summer for calgary coprus comptetion but did not complete and not made working prototype, just some middle approximation between working code and hello world...
for my pity i was rude with eugene shelwien so he stopped conversations with me, but he has received phda9 dictionary so he has reversed engineered phda9 at least partially...i think why he is not submitting entry for competition by himself? he is doing a lot of creative jobs for community for nothing of profit, i think why? what is his goal? what is his interest in this field? a lot of dark matter