A92: LZW Algorithms


[Next][Index][Thread]

A92: LZW Algorithms




	Hello

I am writting a LZW library. The extract function is OK, and the compress function is now OK but without any dynamic allocation.

And I would want to ask you your opinion about something : currently each entry of the dictionnary can ONLY have 255 chars. (indeed in the dictionnary there is one byte for each entry size) 
Do you think it is enough ? Would it be better to replace the byte by a word ?

Please, if you know LZW algorithms, could you tell me your opinion ?

Thanks a lot.
Benoit SCHERRER
p.c.scherrer@wanadoo.fr