A Crash Course on Data Compression.

Decompression routines for ancient formats

Fast and memory-efficient ANN with a subset-search functionality

Massively Parallel Huffman Decoding on GPUs

COllapsed and COmpressed trie: a data-aware compressed string dictionary

Massively Parallel ANS Decoding on GPUs

Arithmetic Coding for Data Compression

A C++ library to compress or expand binary data using Run-Length Encoding

A FASTQ lossless compression algorithm especially designed for nanopore sequencing FASTQ files.

This Repo Includes Data Compression Algorithm and Source Code Implemented Using Huffman Algorithm.

LZW stands for “Lempel-Ziv-Welch”. The LZW algorithm is a very common compression technique. This algorithm is typically used in GIF and PDF. It is lossless, meaning no data is lost when compressing. The algorithm is simple to implement and has the potential for very high throughput in hardware implementations. It is the algorithm of the widely …

This is a very simple file compression tool written in C++.

LZ77 algorithm, providing efficient lossless data compression and decompression capabilities. It offers a reliable and flexible solution for reducing file sizes in various programming languages.

This is a proof of concept for an experimental data compression technique that applies Markov chains to Huffman coding.

Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems

Using C++ to implement Vector Quantization Encoder

This project provides a C++ implementation of an in-place string compression algorithm, which reduces the size of strings by encoding consecutive repeating characters with the character followed by its repetition count.

Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman.

LZW and AAC Data Compression

PAQ8PX compression archiver