Search Results for "huffman c++"
Sort By:
Showing 23 open source projects for "huffman c++"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
Brotli
Brotli compression format
Version 1.0.9 contains a fix to "integer overflow" problem. This happens when "one-shot" decoding API is used (or input chunk for streaming API is not limited), input size (chunk size) is larger than 2GiB, and input contains uncompressed blocks. After the overflow happens, memcpy is invoked with a gigantic num value, that will likely cause the crash. Brotli is a generic-purpose lossless compression algorithm that compresses data using a combination of a modern variant of the LZ77 algorithm,... -
2
Wuffs
Wrangling Untrusted File Formats Safely
...The project ships battle-tested, CPU-friendly implementations for common image/container formats and bit-twiddly primitives like Huffman and checksum routines. Its standard library emphasizes portability and constant-time behavior where appropriate, which is valuable in security-sensitive contexts. Because the language is purpose-built, the resulting C output is small, auditable, and easy to embed in larger systems. -
3
ZAPH
Tools and Z80 engine for creating adventure games. (RUST)
This is an exercise in some advance programming topics using a text adventure as the central result. This originally began as a project to recreate an old BASIC text adventure, on the ZX Spectrum, using Z80. After developing a very simple byte code VM to handle the game interactions, I realised that there was an opportunity to use some more advance techniques, which in turn can lead to some PC based tools. -
4
libjpeg-turbo
SIMD-accelerated libjpeg-compatible JPEG codec library
libjpeg-turbo is a JPEG image codec that uses SIMD instructions (MMX, SSE2, NEON, AltiVec) to accelerate baseline JPEG compression and decompression on x86, x86-64, ARM, and PowerPC systems. On such systems, libjpeg-turbo is generally 2-6x as fast as libjpeg, all else being equal. On other types of systems, libjpeg-turbo can still outperform libjpeg by a significant amount, by virtue of its highly-optimized Huffman coding routines. In many cases, the performance of libjpeg-turbo rivals... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Major looseless compression algorithms library and documentation. First project: Arithmetic, Huffman, LZ77, LZ78, LZW, RLE. Second project reimplements Deflate. Documentation explains major Entropy Compression Methods.
-
6
Partial Image Encryption encrypts the huffman encoded high frequency coefficients in a jpg image file. The encryption is done in-place so the project can eventually be ported to a Windows kernel filter driver. Just encrypting the high level frequency coefficients serves to blur the image, but almost in an artistic way. The image contents are fully recognizable, but the details are pixelated or blurred. The general purpose of this program would be for securing images on the disk or in the...
-
7
Static Huffman algorithm implementation using C++/Qt. Can compress files less than 50 Mb. Execute static_build.exe and try it.
-
8
Text Zip
This software zips and unzips a text file
This software zips and unzips a .txt file, using the Huffman encoding algorithm and the list and tree data structures. The result files are named zippedFile.txt and unzippedFile.txt and can be found at the same directory as the Text Zip executable file. -
9
Huffman Stuff
I want to test some ways to store the data for the Huffman Tree
Lectures on Huffman Code mostly focus on creating the Huffman Tree and converting the given data into the new bitmap. But what about the informations needed to create the Huffman Tree? They must be stored as well. With this project I want to test some possibilities to store these data. gmp,h is needed to compile. See: http://gmplib.org/ -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
hufc is a utility to compress or expand files using Huffman coding. It can use a 16-bit CRC or the IP checksum for error detection.
-
11
-
12
Simple Huffman Coder
Simple huffman coder for learning purposes
This project is built for learning purposes so it's implementation is kept simple and easy to read. It has two functions to either encode or decode a file with the expectation that you will modify it to suite your needs best. -
13
BuddhaPalm
a compress software
这是一个简单的基于huffman编码的压缩软件，用C实现，两个人实现 -
14
-
15
ARM7 targeted MP3 player. Fixed point 16 bit. Purpose is to buid an MP3 player with the lowest possible cost. Works on mono files (going stereo shouldn't be very complicated). Doesn't use Helix. The huffman decoding uses a clustering based algorithm.
-
16
Basic Compression Library is a portable library of well known compression algorithms, such as Huffman coding, written in standard ANSI C. It is intended to serve as a set of building blocks for specialized compression algorithms.
-
17
A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.
-
18
The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
-
19
Help implement an industrial strength Burrows-Wheeler transform compressor! Initial release covers block-sort, MTF coding, RLE coding, Huffman coding
-
20
-
21
Algorithm that can generate any given series of probabilities G, using only fair coins. The algorithm creates a Huffman tree by decomposing any probability P into a sum of probabilites Q, where each Q is a power of 1/2. Than using the coins, the tra
-
22
-
23
huffman-compression-library
A light weight C++ library implementation of huffman coding compression algorithm
- Previous
- You're on page 1
- Next
