Parallel lossless image compression using Huffman and arithmetic coding
From MaRDI portal
Publication:671379
DOI10.1016/0020-0190(96)00090-7zbMATH Open0900.68435OpenAlexW1992096142MaRDI QIDQ671379FDOQ671379
Authors: 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
Recommendations
Cites Work
- A Method for the Construction of Minimum-Redundancy Codes
- Run-length encodings (Corresp.)
- Title not available (Why is that?)
- Optimal source codes for geometrically distributed integer alphabets (Corresp.)
- Constructing codes with bounded codeword lengths (Corresp.)
- Optimal Binary Search Trees with Restricted Maximal Depth
Cited In (11)
- ARITHMETIC CODING IN PARALLEL
- Bitplane Image Coding With Parallel Coefficient Processing
- Context-based compression of binary images in parallel
- Parallel coding of binary images
- Title not available (Why is that?)
- Title not available (Why is that?)
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
- Parallel Huffman Decoding with Applications to JPEG Files
- Parallel Lempel Ziv coding
- Scalability and communication in parallel low-complexity lossless compression
- Title not available (Why is that?)
This page was built for publication: Parallel lossless image compression using Huffman and arithmetic coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671379)
