Abstract | ||
---|---|---|
A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly in most cases. An extension to JPEG decoding is mentioned. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1109/DCC.2000.838178 | Data Compression Conference |
Keywords | Field | DocType |
Huffman codes,data compression,decoding,image coding,parallel algorithms,synchronisation,Huffman codes,JPEG decoding,image compression,parallel algorithm,resynchronization | Modified Huffman coding,Lossless JPEG,Sequential decoding,Computer science,Algorithm,Theoretical computer science,Huffman coding,Shannon–Fano coding,List decoding,DEFLATE,Canonical Huffman code | Conference |
ISSN | ISBN | Citations |
1068-0314 | 0-7695-0592-9 | 3 |
PageRank | References | Authors |
0.38 | 16 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shmuel T. Klein | 1 | 3 | 0.38 |
Yair Wiseman | 2 | 158 | 14.60 |