Search Results for ".bcm compression source code"

PeaZip is a free archiver tool. The application provides an unified, natively portable, cross-platform file manager and archive manager GUI for many Open Source technologies like 7-Zip, FreeArc, PAQ, UPX. Create: 7Z, ARC, Brotl, BZip, GZip, PEA, TAR, WIM, XZ, ZPAQ, ZIP, Zstandard files and more Open and extract 200+ file types: ACE, CAB, DEB, ISO, RAR, ZIPX and more Features of PeaZip includes extract, create and convert multiple archives at once, create self-extracting archives...

LAME is an educational tool to be used for learning about MP3 encoding. The goal of the LAME project is to improve the psycho acoustics, quality and speed of MP3 encoding. Note: we provide source code only!

BCM is a high-performance file compressor that utilizes advanced context modeling techniques to achieve a very high compression ratio. All in all, it's like a big brother of the BZIP2.

Lossless compressor for multichannel 8,16 and 24 bits audio data, with the ability of password data protection. Being 'lossless' means that no data/quality is lost in the compression - when uncompressed, the data will be identical to the original.

SEG-Y files need special compression because they don't compress well using gzip and the like. The code is cross-platform C++ using nothing else than standard system libraries. This is a spin-off from the OpendTect project (http://opendtect.org).

Java HTML/XML Compressor is a very small, fast and easy to use library that compresses given HTML or XML source by removing extra whitespaces, comments and other unneeded characters without breaking the content structure.

OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)

Shoelacer generates C code to compress short strings based upon provided sample data. The resulting routines use small models with low memory overhead.

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.

A pure-Java compression library suitable as a drop-in replacement to current native implementations of java.util.zip. Typical scenarios where it is useful are applets, where access to native code is not allowed. It may also be useful on platforms where it

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...