Lossless data compression using optimal prefix codes based on symbol frequencies. Developed by David Huffman in 1952 for minimum-redundancy coding.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Statistical |
| Security status | Not classified |
| Complexity | Intermediate |
| Inventor | David Albert Huffman |
| Year | 1952 |
| Origin | 🇺🇸 United States |
| Source | algorithms/compression/huffman.js |
Status: not classified — treat as unverified.
No vulnerabilities are recorded for this implementation.
2 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty input
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000010000000000000000000000 00000000000000000000000000000000 00000000000000000000000000000000 00000000000000000000000000000000 … (260 bytes; the full value is in the source) |
Vector 2 — Single byte 0x41
| Field | Value |
|---|---|
input |
41 |
expected |
01000000010000000000000000000000 00000000000000000000000000000000 00000000000000000000000000000000 00000000000000000000000000000000 … (261 bytes; the full value is in the source) |