Parallel lossless image compression using Huffman and arithmetic coding

DOI10.1016/0020-0190(96)00090-7zbMath0900.68435OpenAlexW1992096142MaRDI QIDQ671379

Paul G. Howard, Jeffrey Scott Vitter

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1808/7207

zbMATH Keywords

Parallel algorithmsHuffman codingArithmetic codingData compression

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Arithmetic codes (94B40) Source coding (94A29)

Cites Work

• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Constructing codes with bounded codeword lengths (Corresp.)
• Optimal Binary Search Trees with Restricted Maximal Depth
• A Method for the Construction of Minimum-Redundancy Codes
• Run-length encodings (Corresp.)
• Unnamed Item

This page was built for publication: Parallel lossless image compression using Huffman and arithmetic coding