| View previous topic :: View next topic |
| Author |
Message |
Nimo
Guest
|
 Posted: Sun Oct 26, 2008 6:58 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 one 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 |
Phil Carmody
Guest
|
| Posted: Sun Oct 26, 2008 8:00 am Post subject: Re: New Algorithm |
|
|
Nimo <azeez541@gmail.com> writes:
| 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
|
What do you do with the following 2 strings?
10
1100
| Quote: | Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB.
|
You're just another compression loon. If you're unable to come up
with a 4-bit counterexample to your own wacky ideas, then you're
obviously not cut out for work in the field. Please pack up your
computer and return it to the shop where you bought it, it's of
no further use to you.
Phil
--
The fact that a believer is happier than a sceptic is no more to the
point than the fact that a drunken man is happier than a sober one.
The happiness of credulity is a cheap and dangerous quality.
-- George Bernard Shaw (1856-1950), Preface to Androcles and the Lion |
|
| |
|
| Back to top |
Nimo
Guest
|
| Posted: Tue Oct 28, 2008 5:49 am Post subject: Re: New Algorithm |
|
|
| Quote: | What do you do with the following 2 strings?
10
1100
|
| Quote: | You're just another compression loon. If you're unable to come up
with a 4-bit counterexample to your own wacky ideas, then you're
obviously not cut out for work in the field. Please pack up your
computer and return it to the shop where you bought it, it's of
no further use to you.
|
May be you didn't see the first steps of the algorithm.
A=10 10 10 10 10 10 10 10 10 10.............10(n)
(1)for your first string this is the answer 10(1)
(2)for your second string,
1100---(1)-->11 00----(2)--->10----(3)----->10(n)------->10(1).
Thanks. |
|
| |
|
| Back to top |
|
