Practices of Algorithm for hard problems
-
Updated
Feb 10, 2020 - Java
Practices of Algorithm for hard problems
A block sorting lossless data compression algorithm
This repository contain the most important contextual data transformation algorithms which help to improve the rate compression reached by statistical encoders. Ramses Alexander Coraspe Valdez
A New Approach for Efficient Sequential Decoding of Static Huffman Codes
A Fast C++ Lossless Compress/Decompress CLI Program with High Compression Ratio
Zip and unzip files using Huffman coding with Burrows Wheeler and Move To Front (BW and MTF are only applied to small files)
Implementation of the algorithm "Move to front" in python for data compression
A parallel implementation of the bzip2 data compressor in python, this data compression pipeline is using algorithms like Burrows–Wheeler transform (BWT) and Move to front (MTF) to improve the Huffman compression. For now, this tool only will be focused on compressing .csv files, and other files on tabular format.
PUBLIC | FCTUC DEI/LEI 2021/2022 - Licenciatura em Engenharia Informática | TI - Teoria da Informação | Trabalhos Práticos: TP0, TP1 e TP2
My CS Bachelor Thesis (Summer 2022)
Context aware Move To Front Transform based compressor
Extreme inline text compression for HTML / JS. A custom pipeline that generates stand-alone HTML or JS files which embed competitively compressed self-extracting text, with file sizes of 25% - 40% the original.
Frontend side of TextFile compression using LZW Algorithm with MERN techstack
Backend side of TextFile compression using LZW Algorithm with MERN techstack
A (rookie makeshift improvised amateur suboptimal crude non-production-ready) bzip2 compression algorithm implementation from scratch.
Add a description, image, and links to the move-to-front topic page so that developers can more easily learn about it.
To associate your repository with the move-to-front topic, visit your repo's landing page and select "manage topics."