Im starting uni project, and im basing it on a text compression application. Ill be using data based compression and was woundering what your views on this may be, ie easier than huffman to code, what possible problems can you for see me having?
thanks for the help, great forum.
kelvin
May I suggest researching the topic yourself first? You can always post a specific question later on.
Here's a good starting point: http://en.wikipedia.org/wiki/Compression_algorithm
or
Google, of course: http://www.google.nl/search?hl=nl&q=text+compression+algorithm&meta=
Good luck.
i have done some research and i have decided to use a dictionary of characters and words and assign bites to least according to their overall probabilities or occurance in the english language not probability within the text (this should keep things simpler).
What i need is a table of probabilities, im sure i read that hufman produced one, anyone know where i can get itOnce i have this i plan to place this into a array for store and then im going to find theletters and words in array of probability and then assign the bites to those letters.
What are your views on this aproach?
thanks for given your thoughts so far.
kelvin