Click here to Skip to main content
15,609,235 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hi guys,

I was planning on making a Compressor/De-compressor with the Lempel-Ziv-Welch alogarithm. I've been looking around the internet for some implications and noticed that they're really long when making a the compressor alone. Does anyone know a simple code so I can understand it? A simple compressor and decompressor using LZW alogarithm. I plan on using textfiles first :)

*this isn't a home work. I'm just trying to get a broader view of these things.
Updated 17-Mar-14 23:22pm
Vedat Ozan Oner 18-Mar-14 5:21am    
:) I implemented that algorithm as the final project. I would share it but unfortunately it was very long time ago and I lost it (possibly somewhere in a CD). maybe you know, but the idea is to construct a dictionary for binary sequences. use short key for a long repeating series, and add new key (longest) for a new sequence. (or something like that :))
bittertongue 18-Mar-14 5:36am    
I'm sorry. I don't really understand what you mean :O how is it suppose to look like?

1 solution

If you want some code to play with, search for past CP articles.[^]

There are some tutorials out there too.[^]
Share this answer

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900