Release Some Transform I Researched.

Hi all,

Just wanna put some more idea on this group hope someday
some what improvement of compression would happen, The
following ideas are not new or old... just like that.
I wish expert here could do something about it.
I declare that this transform methods are released
in GPL, general public license. Use it to do good, avoid
evil.


1) transformation method 1

10001010 1001010101 1000010100000
1010011 10110011 101011001010
1001 10001 10011101100
10 101 1011110001
1 1 10000010
1010100
100110
10111
1

explaination, as you can see, any binary string start
with 1 and end with zero could be reducted until it
end with one, which you will need extra information
to construct it back, in my knowledge, I couldnt find
a better way to store those extra information, but
expert like you can... I hope it could become something
useful. *note that first 0 become 1, if 0 again will turn
the bit to 1, and if 10 will turn again to two zero, which
mean the bit are switching and the length is determine by
simple bit code, 10 - 2, 110 - 3, 1110 - 4 and etc.


2) Transformation method two,
for a sequence of number 412312321, it is possible to
store the length and N choose R pairs like this

412312321
0
312312321
00
202312321
001 there is an 0, so state 1
1x1312321
0010 after there is an 0, mark it with x
0x0212321
00102 there is two zero, mark it as 2
xxx102321
001021
xxx1x1321
0010210
xxx0x0221
00102102
xxxxxx111
001021020
xxxxxx000
0010210203
xxxxxxxxx

the length string is now 0010210203 which can
be use to determine N,R from N choose R,
but the count and integer has to store in anothe way,
I can stil reach by email for any idea and improvement,
the number can increase to 255 to represent bytes value
and place not that the pointer move from one position to
another and all values before the pointer are decrease
by one. until it become zero, we calculate the number
of zero and store it.

the length string contains N and R info, can be
further compressed. and the integer data could be compress
too, it might be a recursive compressor.





Regards
Ang Li Kai

Software Engineer
- CL computer Malaysia

.

Relevant Pages

  • Re: Compression leads to encryption NEW COMPRESSION METHOD!
    ... And is it possible to go backwards given this string? ... of 24.27 bits based on the One occuring 40% of the time and the Zero ... You have to account for every possible input string. ... My Compression code http://bijective.dogma.net/ ...
    (sci.crypt)
  • Re: =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>>of the string. ... >> universal computing device, say an universal Turing machine, which IS ... K.C. is defined to require an universal computer, ... >These are different forms of potential compression. ...
    (talk.origins)
  • =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>of the string. ... These are different forms of potential compression. ... >>functional system may not be able to sustain such sequence compression ... Chaos theory is about DETERMINISTIC systems which amplify small ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... If I am allowed to choose the compression algorithm *after* ... which compresses that string to a single bit. ... If you are allowed to transmit the data separately, ...
    (talk.origins)
  • Re: Just for fun...
    ... complexity in practical scenarios... ... corresponding complexities for a given string can differ at most by a constant ... When I first learned about the concept of compression, ... surprise in the questions/issues being discussed, ...
    (comp.lang.ruby)