> continuing from Pierre's threadshttp://
groups.google.com/group/comp.compression/browse_thread/thread/...
>
> In a ternary file with symbols a b c
>
> only condition here is total# of c ALWAYS exact = total# b + 2 & this
> occurs only at EOF , ie at any stage IF progressive total# c
> becomes = progressive # b + 2 then file ends .
>
> [ total# a unrestricted , usually around same as total# b BUT this is
> irrelevant ]
>
> What is the entropy of a file with N symbols ( total # a + total # b +
> total # c = N , which is N * 1.5 binary bits ) , and how best
> practical encode smallest possible ( than N * 1.5 binary bits ) ?
>
> THIS WILL HAVE IMMEDIATE VERY PRACTICAL SIGNIFICANCE not merely
> intellectual exercise
>
> LawCounsels
Tenary storing is 1.584965 bit per symbol, it is not possible to
encode ternary to 1.5
There is no transform that can ensure that c is + 2 of b, you can
ensure that by append your extra 2 c
No, it won't change anything.
You can help me back either, if you can hide the sign bit of any
string sequence without increase its size, I can show you method that
is far more advance.
Regards,
Raymond