Search Results for "c algorithms"

Snappy is a compression/decompression library. It does not aim for maximum compression, or compatibility with any other compression library; instead, it aims for very high speeds and reasonable compression. For instance, compared to the fastest mode of zlib, Snappy is an order of magnitude faster for most inputs, but the resulting compressed files are anywhere from 20% to 100% bigger. Snappy is intended to be fast. On a single core of a Core i7 processor in 64-bit mode, it compresses at...

Moved to GitHub.com/gdraheim/zziplib/ The ZZIPlib provides read access on ZIP-archives. The library uses only the patent-free compression-algorithms supported by Zlib. It provides functions that transparently access files being either real files or zipped files, both with the same filepath

Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.

Basic Compression Library is a portable library of well known compression algorithms, such as Huffman coding, written in standard ANSI C. It is intended to serve as a set of building blocks for specialized compression algorithms.

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.

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In...