A space-efficient Huffman decoding algorithm and its parallelism

DOI10.1016/S0304-3975(99)00080-8zbMath0961.68047MaRDI QIDQ1583590

R. Smith

Publication date: 31 October 2000

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

zbMATH Keywords

CREW PRAM; Huffman tree

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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

Cites Work

• Unnamed Item
• Memory efficient and high-speed search Huffman coding
• Parallelism in random access machines
• A Method for the Construction of Minimum-Redundancy Codes