You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This repository contains a C implementation of the Huffman coding algorithm, which is an efficient method for lossless data compression. The code constructs a Huffman tree based on the frequency of characters in a given message and generates a unique binary code for each character, minimizing the overall space required to store the message.
A flexible Python tool for compressing data files with gzip, perfect for efficiently storing or transmitting large amounts of data without compromising quality.
This project was aimed to complete my Bachelor Degree in Computer Science @2011 in University of Sumatera Utara, Indonesia. This project is a software that implements Lossless Data Compression Algorithms (Lempel Ziv Welch, Arithmetic Coding, Burrows Wheeler Transform, and Run-Length Encoding Algorithm)