| View previous topic :: View next topic |
| Author |
Message |
Nimo
Guest
|
 Posted: Sun Oct 26, 2008 7:13 am Post subject: New Algorithm |
 |
|
For the last 20 days trying very hard to come with very new
Method just landed here,lets see
110100001001000011111101001000
Assume A= 101010101010..........10(n)
& (A bar)=010101010101..........01(n)
Step1:- divide given string to pairs
11 01 00 00 10 01 00 00 11 11 11 01 00 10 00
-----------------------------------------------------------------
Step2:-11=0,00=0
1 01 0 0 10 01 0 0 1 1 1 01 0 10 0
-----------------------------------------------------------------
Step3:-merge it
1010010 0100111010100
----------------------------------------------------------------
Step4:-again divide in to pairs
10 10 01 00 10 01 11 01 01 00
---------------------------------------------------------------
Step5:- 11=0,00=0
10 10 01 0 10 01 1 01 01 0
--------------------------------------------------------------
Step6:-merge it
10100101001101010
-------------------------------------------------------------
Step7:-again pairs
10 10 01 01 00 11 01 01 0
here left out with single zero,write it as it is
--------------------------------------------------------------
Step8:-
10 10 01 01 0 1 01 01 0
--------------------------------------------------------------
Step9:-merging and pairing
101001010101010
10 10---01 01 01 01 01----0
2(As),4(A bars) and a 0.
Falsification test:-Only works with 0 and 1 but not
with this type of strings aaabbbacaaacc10111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB. |
|
| |
|
 Back to top |
Guest
|
| Posted: Tue Oct 28, 2008 2:07 am Post subject: Re: New Algorithm |
|
|
On 26 oct, 05:13, Nimo <azeez...@gmail.com> wrote:
| Quote: | For the last 20 days trying very hard to come with very new
Method just landed here,lets see
110100001001000011111101001000
Assume A= 101010101010..........10(n)
& (A bar)=010101010101..........01(n)
Step1:- divide given string to pairs
11 01 00 00 10 01 00 00 11 11 11 01 00 10 00
-----------------------------------------------------------------
Step2:-11=0,00=0
1 01 0 0 10 01 0 0 1 1 1 01 0 10 0
-----------------------------------------------------------------
Step3:-merge it
1010010 0100111010100
----------------------------------------------------------------
Step4:-again divide in to pairs
10 10 01 00 10 01 11 01 01 00
---------------------------------------------------------------
Step5:- 11=0,00=0
10 10 01 0 10 01 1 01 01 0
--------------------------------------------------------------
Step6:-merge it
10100101001101010
-------------------------------------------------------------
Step7:-again pairs
10 10 01 01 00 11 01 01 0
here left out with single zero,write it as it is
--------------------------------------------------------------
Step8:-
10 10 01 01 0 1 01 01 0
--------------------------------------------------------------
Step9:-merging and pairing
101001010101010
10 10---01 01 01 01 01----0
2(As),4(A bars) and a 0.
Falsification test:-Only works with 0 and 1 but not
with this type of strings aaabbbacaaacc10111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB.
|
How are you going to decompress that?
The most important (otherwise is not lossless) thing for a lossless
compressor is that the decompressed data should be exactly equal to
the original data under any circumstance. If people didn't need the
original contents of their files they would delete them rather than
compress them.
For any lossless compressor you cannot guarantee that it will be able
to compress any file as you cannot get 2^N (number of possible files
of size N) different inputs from less than 2^N (less than N bits)
outputs |
|
| |
|
| Back to top |
ggf31416
Guest
|
| Posted: Tue Oct 28, 2008 2:59 am Post subject: Re: New Algorithm |
|
|
On 26 oct, 05:13, Nimo <azeez...@gmail.com> wrote:
| Quote: | For the last 20 days trying very hard to come with very new
Method just landed here,lets see
110100001001000011111101001000
Assume A= 101010101010..........10(n)
& (A bar)=010101010101..........01(n)
Step1:- divide given string to pairs
11 01 00 00 10 01 00 00 11 11 11 01 00 10 00
-----------------------------------------------------------------
Step2:-11=0,00=0
1 01 0 0 10 01 0 0 1 1 1 01 0 10 0
-----------------------------------------------------------------
Step3:-merge it
1010010 0100111010100
----------------------------------------------------------------
Step4:-again divide in to pairs
10 10 01 00 10 01 11 01 01 00
---------------------------------------------------------------
Step5:- 11=0,00=0
10 10 01 0 10 01 1 01 01 0
--------------------------------------------------------------
Step6:-merge it
10100101001101010
-------------------------------------------------------------
Step7:-again pairs
10 10 01 01 00 11 01 01 0
here left out with single zero,write it as it is
--------------------------------------------------------------
Step8:-
10 10 01 01 0 1 01 01 0
--------------------------------------------------------------
Step9:-merging and pairing
101001010101010
10 10---01 01 01 01 01----0
2(As),4(A bars) and a 0.
Falsification test:-Only works with 0 and 1 but not
with this type of strings aaabbbacaaacc10111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB.
|
How are you going to decompress that?
The most important thing for a lossless compressor (otherwise is not
lossless) is that it should be able to recover the original data. If
people didn't need their original files they would delete them rather
than compress them.
A lossless compressor cannot guarantee that the compressed size will
be smaller than the original size for all files because you cannot
recover 2^N different inputs (files of size N bits) from less than
2^N outputs (compressed files of size < N bits). |
|
| |
|
| Back to top |
|
