Beating Lemepl-Ziv?

I've been researching data compression since I've recently become interested in the topic again, and one thing that I just want to make sure of is that Lempel-Ziv algorithms are the most used today. From what I've seen .zip, .png, .gif, and various other file types all use some form of a Lempel-Ziv algorithm for lossless data compression. Of course, Huffman or run-length encoding could be applied as well, but the Lempel-Ziv algorithm is what truly gives the greatest compression ratio for the data.

Now, assuming what I asked prior is right, if I came up with a better algorithm than Lempel-Ziv could I get my name on this list??

http://en.wikipedia.org/wiki/List_of_IEEE_milestones

The list linked above shows milestones in electrical and electronics engineering. If you scroll to the bottom of it, third from the last is the Lempel-Ziv data compression algorithm.

I honestly feel like I've found a better algorithm for compression quality (although I still need to code and test my idea out ). Do I stand decent chances of getting some kind of achievement like that if my idea is truly novel and better?

P.S> Also, I wasn't really sure where to post this, but since data compression seemed like something best handled in C, I put this post here.

P.P.S?> I know I didn't mention this above, but I also understand that if you know with certainty what you are compressing (like a picture) a specialized algorithm could work better (as in a .jpeg file)

Perhaps you should read this
http://www.faqs.org/faqs/compression-faq/part1/
(this is old, check the newsgroups for the latest version).

The best place to ask IMO would be the newsgroup comp.compression or comp.compression.research

And this
http://en.wikipedia.org/wiki/List_o...sion_algorithms
Are you sure you didn't just rediscover something else?

Sure! Immortalize yourself. Get a statue! I have patents. Whoot!

Mmm. Write a program, test your algorithm, make sure that files of random data don't inflate too heavily. If it works, publish, or consult with patent lawyer.

A significant issue is how much _better_ is your algorithm. Unless it is a whole lot better (like 50% or more) more than likely no one is going to bother considering using your (relative to LZ) untested code and will simply stick with what they have. If you choose to patent your algorithm it gets even worse, forget open source implementations (many won't even consider using anything patented until the patent expires even if you choose to release it to the public) and most closed source implementations.

However, if your algorithm performs a whole lot better AND you make it open source (i.e., no intellectual property rights) THEN you might get some acceptance. Still, you will have the chicken-and-egg issue of it won't get popular until it is everywhere and it won't be everywhere until it gets popular.

It is an interesting topic and one you might be better off using as the basis for a thesis rather than attempting to 'get noticed'.

Hi,

grow up.

If you have nothing concrete to say and just dream of big fame, I doubt you're any better than the people constantly popping up in some forum or mailing list and declaring they've found a revolutionary new "encryption algorithm" or whatever.

And those guys are at least funny.