A memory-efficient and fast Huffman decoding algorithm (Q294633): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q126572628, #quickstatements; #temporary_batch_1722035971323 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Huffman decoding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-synchronizing Huffman codes (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Memory efficient and high-speed search Huffman coding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126572628 / rank | |||
Normal rank | |||
Latest revision as of 01:20, 27 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A memory-efficient and fast Huffman decoding algorithm |
scientific article |
Statements
A memory-efficient and fast Huffman decoding algorithm (English)
0 references
16 June 2016
0 references
data structures
0 references
decoding algorithm
0 references
Huffman code
0 references
