Enhanced Golomb coding using OpCodes.BitStream for optimal prefix coding of geometric distributions. Demonstrates advanced bit-level operations for compression algorithms.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Entropy Coding |
| Security status | Not classified |
| Complexity | Intermediate |
| Inventor | Solomon W. Golomb (Enhanced) |
| Year | 1966 |
| Origin | 🇺🇸 United States |
| Source | algorithms/compression/golomb-bitstream.js |
Status: not classified — treat as unverified.
No vulnerabilities are recorded for this implementation.
5 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty input
| Field | Value |
|---|---|
input |
(empty) |
expected |
(empty) |
Vector 2 — Rice coding k=2, input=0
| Field | Value |
|---|---|
input |
00 |
expected |
020100 |
Vector 3 — Rice coding k=2, sequence 0,1,2
| Field | Value |
|---|---|
input |
000102 |
expected |
020318 |
Vector 4 — FLAC residual pattern
| Field | Value |
|---|---|
input |
00000100020100 |
expected |
02070488 |
Vector 5 — Rice coding k=2, powers of 2
| Field | Value |
|---|---|
input |
04080c10 |
expected |
0204cf3f3fc0 |