| View previous topic :: View next topic |
| Author |
Message |
Nimo
Guest
|
 Posted: Sun Oct 26, 2008 6:49 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 aaaabbbacacc100111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB. |
|
| |
|
 Back to top |
Fibonacci Code
Guest
|
| Posted: Tue Oct 28, 2008 6:33 am Post subject: Re: New Algorithm |
|
|
On Oct 26, 2:49 pm, 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 aaaabbbacacc100111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB.
|
Huh ? 11=0, 00=0 how can you tell 0 is 11 or 00 ?
if you cannot tell, how can you construct back the string ?
if you tell by adding extra bit, then there will be no compression or
expand.
So the method is not valid.
Fibonacci |
|
| |
|
| Back to top |
Nimo
Guest
|
| Posted: Tue Oct 28, 2008 7:21 pm Post subject: Re: New Algorithm |
|
|
Yeah people I got Ur valid points,
I'm just 20,but in able to come up for a new method,
I'm trying every possible way,thanks for your clarification.
Thanks:)
wait until I'll come up with new concept
10 days,100MB=100/250KB,mission accomplishing.....!
Critique of C++(~Opp).
Rejector of Euclidean Geometry,
Doesn't believe in Present Atomic Model.
Admirer of Rene Descartes. |
|
| |
|
| Back to top |
Fibonacci Code
Guest
|
| Posted: Wed Oct 29, 2008 5:23 am Post subject: Re: New Algorithm |
|
|
On Oct 29, 3:21 am, Nimo <azeez...@gmail.com> wrote:
| Quote: | Yeah people I got Ur valid points,
I'm just 20,but in able to come up for a new method,
I'm trying every possible way,thanks for your clarification.
Thanks:)
wait until I'll come up with new concept
10 days,100MB=100/250KB,mission accomplishing.....!
Critique of C++(~Opp).
Rejector of Euclidean Geometry,
Doesn't believe in Present Atomic Model.
Admirer of Rene Descartes.
|
Nimo,
I was like you 
I started to dream on this magic compressor at the age of 14.
Fibonacci |
|
| |
|
| Back to top |
Nimo
Guest
|
| Posted: Wed Oct 29, 2008 7:08 am Post subject: Re: New Algorithm |
|
|
wow.....!
how far did you succeed?
any new methods did you try?.
I tried HCM to code,I think my personal view is that in reality its
very tough
and it would generate more information for very small input,more over
that method is
of no use.
Mission Accomplishing.....!
Critique of C++(~Opp).
Rejector of Euclidean Geometry,
Doesn't believe in Present Atomic Model.
Admirer of Rene Descartes. |
|
| |
|
| Back to top |
Fibonacci Code
Guest
|
| Posted: Wed Oct 29, 2008 10:06 am Post subject: Re: New Algorithm |
|
|
On Oct 29, 3:08 pm, Nimo <azeez...@gmail.com> wrote:
| Quote: | wow.....!
how far did you succeed?
any new methods did you try?.
I tried HCM to code,I think my personal view is that in reality its
very tough
and it would generate more information for very small input,more over
that method is
of no use.
Mission Accomplishing.....!
Critique of C++(~Opp).
Rejector of Euclidean Geometry,
Doesn't believe in Present Atomic Model.
Admirer of Rene Descartes.
|
Hi Nimo,
So far there aren't any method would able to do that.
Information is much like the smallest unit of item in the
universe.
single bit can represent the planet or the super string or a
quantum.
The only hope I see is to use the string itself against
itself. But the shortest string to
represent itself is the string itself.
I won't give u much hope, as it is proven mathematically
impossible.
If you happen to break it. Let me know.
Thanks.
Fibonacci |
|
| |
|
| Back to top |
|
