C-ryptFile is a C-based terminal utility designed to securely encrypt and compress personal files using customized Huffman coding principles.
-
Updated
Jan 14, 2026 - C
C-ryptFile is a C-based terminal utility designed to securely encrypt and compress personal files using customized Huffman coding principles.
Browser-based Huffman encoding visualisation tool written in Typescript with HTML Canvas.
Archiver based on the Huffman algorithm in Qt
A C++-based lossless file compressor and decompressor built using Huffman Coding, designed to demonstrate strong Object-Oriented Programming principles, binary file handling, and algorithmic efficiency.
C++ implementations of real time dynamic planar convex hull construction algorithms.
Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]
Huffman code
Simple text file compression and decompression tool
A pipelined Enigma-based encryption and Huffman compression system for secure and efficient text storage.
An implementation of a Huffman Encoding algorithm that generates a Huffman table for a given text file
A standalone Python GUI for Q-ary Huffman encoding with frequency analysis, tree visualization, and compression metrics.
This project implements the Huffman compression algorithm, a popular and efficient lossless data compression technique. It calculates character frequencies from the input, builds an optimized Huffman tree, generates corresponding binary codes, and uses these codes to compress and decompress textual data.
Stanford CS106B Assignment 6
This project implements Huffman Tree Compressor and Decompressor which is a lossless data compression algorithm using C language. The project aims to not use any includes other than <stdlib.h>, <stdio.h> and implements all the necessery data structures as well because main aim is to practice data structures on a relatively lower level language.
Java Projects
A simple implementation of Huffman Tree algorithm for text encryption and decryption.
🔐 CoDeCo is a web-based visualization tool for understanding the Huffman coding and decoding algorithms. It provides an interactive way to see how data compression works step by step. This project was built to help students and developers better understand Huffman coding through intuitive and dynamic visualizations.
复现一下经典的 Word2Vec模型,顺便对其原理做一下笔记,免得面试一脸懵。
Add a description, image, and links to the huffman-tree topic page so that developers can more easily learn about it.
To associate your repository with the huffman-tree topic, visit your repo's landing page and select "manage topics."