With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Gemini 3 and 200+ AI Models on One Platform
Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.
Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
Implementation of the LZW algorithm in C#, adhering to the built-in System.IO.Compression.
The algorithm and code is much improved, compared to projects like SharpLZW.
The LZW algorithm is for arbitrary lossless data compression and are noticeable for simplicity and low (compared to others) memory consumption. Making it interesting for eg. embedded use.
There're many other LZW implementations out there. This one is focused on KISS and C#.
[2014-10-31] This project is obsolete, for latest version (6.1.3) see GitHub https://github.com/digital-preservation/droid (source) and http://www.nationalarchives.gov.uk/information-management/manage-information/preserving-digital-records/droid/ (binary)
DROID (Digital Record Object Identification) is an automatic file format identification tool. It is the first in a planned series of tools developed by The National Archives under the umbrella of its PRONOM technical registry service.
[2013-01-24] The binary download of the latest version of DROID has now been moved to The National Archives website: http://www.nationalarchives.gov.uk/information-management/projects-and-work/droid.htm
The source code for the latest version of DROID remains available via Github: http://digital-preservation.github.com/droid/
[2012-09-07] DROID 6.1 has been released. ...
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
ctsplit is a program designed to split a large binary file into smaller byte sized pieces. Included with this project will be source code, linux binaries, windows binaries, User interface (using QT), and documentation.
Languages: C++ and QT