https://github.com/michelenatale/compress
Here are a few smaller projects that demonstrate the compression of texts. Starting with the Huffman code.
https://github.com/michelenatale/compress
compress compression-algorithm huffman-coding huffman-compression-algorithm
Last synced: about 2 months ago
JSON representation
Here are a few smaller projects that demonstrate the compression of texts. Starting with the Huffman code.
- Host: GitHub
- URL: https://github.com/michelenatale/compress
- Owner: michelenatale
- License: gpl-3.0
- Created: 2024-10-16T14:34:34.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-01-20T17:10:34.000Z (4 months ago)
- Last Synced: 2025-01-20T17:32:01.706Z (4 months ago)
- Topics: compress, compression-algorithm, huffman-coding, huffman-compression-algorithm
- Language: C#
- Homepage:
- Size: 72.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Compress
## Huffman Coding
The [Huffman Code](https://en.wikipedia.org/wiki/Huffman_coding) is the typical classic among compression codes, as this is an algorithm for lossless data compression. The C# code has a simple structure and fulfills the very fast derivation of the Huffman code, as well as the decoding. It's worth taking a look.
https://github.com/michelenatale/Compress/tree/main/HuffmanCoding
## Exponential-Golomb-Codes
[Exponential-Golomb-Codes](https://en.wikipedia.org/wiki/Exponential-Golomb_coding) (also known as Exp-Golomb-Coding) represent integers with bit patterns that become longer for larger numbers. One would think. The exponential Golomb code created here performs an analysis beforehand and adjusts the length of the code to the frequency.
https://github.com/michelenatale/Compress/tree/main/ExponentialGolombCode