Search Results for "foremost windows binary"

BWTC32Key is a program I wrote that compresses data, then optionally encrypts it, and then outputs a Base32768 representation as the final output

Introducing Archiver 4.0 - a cross-platform, multi-format archive utility and Go library. A powerful and flexible library meets an elegant CLI in this generic replacement for several platform-specific or format-specific archive utilities. The core library APIs work pretty well but the command has not been implemented yet, nor have most automated tests. If you need the arc command, stick with v3 for now. Create and extract archive files. Walk or traverse into archive files. Extract only...

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

An algorithm for compression and decompression of Binary Decision Diagrams will in many cases reduce the size of the BDD to 1-2 bits per node.

This is a fast binary compression/decompression method based on byte translation through a numerical order sequence that demonstrates the speed and efficiency of binary compression. (http://www.jasenko.com.mk)

Fast and efficient proprietary bit reordering compression. Usefull for compressing binary-text files. Uses binary vectors reordering and dynamic data dictionary. (http://www.jasenko.com.mk)

ebsdiff creates a binary patch file using the bsdiff format. The enhancements to bsdiff are that it stores an MD5 hash of the original file (preventing accidental patching of the wrong file) and can limit the memory it uses while creating the patch file.

Binary XML is java library. Major feature of library is document encoder/decoder which helps to store DOM model in binary format and retrive DOM model back. Encoded file size extremely small (in about 10 times relatively to original) .

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.