A space-efficient Huffman decoding algorithm and its parallelism

DOI10.1016/S0304-3975(99)00080-8MaRDI QIDQ1583590zbMATH OpenFDO

Authors R. Smith

Publication date 31 October 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

CREW PRAMHuffman tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 2086676
• Approximating Huffman codes in parallel
• A memory-efficient and fast Huffman decoding algorithm
• Space-efficient Huffman codes revisited
• A novel memory-efficient Huffman decoding algorithm and its implementation
• An efficient decoding technique for Huffman codes
• scientific article; zbMATH DE number 436071
• Efficient Huffman decoding
• Parallel Huffman Decoding with Applications to JPEG Files
• Parallelized Huffman and Hu-Tucker searching

Cites work

• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Memory efficient and high-speed search Huffman coding
• Parallelism in random access machines

Cited in

(10)

• Level-compressed Huffman decoding
• An efficient finite-state machine implementation of Huffman decoders
• Approximating Huffman codes in parallel
• scientific article; zbMATH DE number 2170434 (Why is no real title available?)
• Memory efficient and high-speed search Huffman coding
• An efficient decoding technique for Huffman codes
• Parallel Huffman Decoding with Applications to JPEG Files
• A memory-efficient and fast Huffman decoding algorithm
• scientific article; zbMATH DE number 2086676 (Why is no real title available?)
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)

This page was built for publication: A space-efficient Huffman decoding algorithm and its parallelism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583590)