Small & portable byte-aligned LZ77 compression

The Minimal LZMA (minlzma) project aims to provide a minimalistic, cross-platform, highly commented, standards-compliant C library (minlzlib) for decompressing LZMA2-encapsulated compressed data in LZMA format within an XZ container, as can be generated with Python 3.6, 7-zip, and xzutils

Study group for algorithms in Ruby, hosted at App Academy

PyLFSR

DotFastLZ - a port of FastLZ, Small and portable byte-aligned LZ77 compression for .NET, C#, Unity3D

📦 Lempel-Ziv Complexity, fast implementations with 🐍 Python (naive, Numba or Cython for speedup), Open-Source (MIT) 👍 →

Compression suite for data frames and tabular data files, csv, excel etc. Using LZHW algorithm.

Pure Python implementation of Deflate data compression algorithm.

A streaming LZ predictor compression tool

SAP Report Source Decompressor

Hamming, Huffman and etc algorithms

Engineered block tree construction based on the Longest Previous Factor array that also works in parallel.

LZ-End parsing algorithms

this is a LZW image compression project using matlab

Fast and space-efficient conversion from the LZ77 parsing to a grammar

RLZAP: Relative Lempel-Ziv with Adaptive Pointers

A high speed LZ style lossless compression tool

Simple LZSS+RLE+RC32 compression algorithm realization (C/C++/Rust).

This repository contains Java code implementing the LZ-78 (Lempel-Ziv 78) data compression algorithm. The LZ-78 algorithm is a lossless data compression method that replaces repeated occurrences of data patterns with references to previously encountered patterns.

This repository contains a Java implementation of the LZ-77 data compression algorithm. LZ-77 is a lossless data compression method that replaces repetitive sequences of characters with references to previously occurring data. It achieves compression by storing the position and length of a match in a sliding window of previously processed data.