This repository was archived by the owner on Sep 30, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
C implementations of the Lempel-Ziv-Welch (LZW) algorithm. Lzwg features optional bitsize (default=16) of dictionary string table size (default=65536). Lzwhc is a single file codec, via faster hashing. Note: lzwg uses maximum 1.7GB+ RAM and lzwhc uses maximum 2.4GB+ RAM @ 28-bit dictionary!
grtamayo/LZW-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This archive contains *basic* implementations of the following algorithm: Lempel-Ziv-Welch (LZW) ( lzwh.c and lzwhd.c [using LZC hashing]; lzwgt.c and lzwgtd.c [using a Binary Search Tree]; lzwg.c and lzwgd.c [using a Binary Search Tree]; lzwhc.c [using LZC hashing, a single file codec]; lzwz.c [using LZC hashing, a single file codec, option to reset dictionary] ). Notes: For personal, academic, and research purposes only. Freely distributable. Gerald R. Tamayo, BSIE(Mapua I.T.) Philippines
About
C implementations of the Lempel-Ziv-Welch (LZW) algorithm. Lzwg features optional bitsize (default=16) of dictionary string table size (default=65536). Lzwhc is a single file codec, via faster hashing. Note: lzwg uses maximum 1.7GB+ RAM and lzwhc uses maximum 2.4GB+ RAM @ 28-bit dictionary!
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published