Name
Abstract | ||
|---|---|---|
A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly, i.e. recovering after possible decoding errors, in most cases. The average number of bits that have to be processed until synchronization is analyzed and shows good agreement with empirical data. As Huffman coding is also a part of the JPEG image compress... |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1093/comjnl/46.5.487 | The Computer Journal |
Keywords | Field | DocType |
huffman codes,parallel algorithm,image compression | Modified Huffman coding,Lossless JPEG,Computer science,Parallel algorithm,Theoretical computer science,Huffman coding,JPEG,Decoding methods,DEFLATE,Canonical Huffman code | Journal |
Volume | Issue | ISSN |
46 | 5 | 0010-4620 |
Citations | PageRank | References |
34 | 1.61 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shmuel Tomi Klein | 1 | 46 | 8.00 |
| Yair Wiseman | 2 | 158 | 14.60 |