Synchronizing dynamic Huffman codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3476581 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A universal algorithm for sequential data compression
- An application of informational divergence to Huffman codes
- Bidirectional Huffman coding
- COMPRESSED PATTERN MATCHING IN JPEG IMAGES
- Compression of individual sequences via variable-rate coding
- Design and analysis of dynamic Huffman codes
- Dynamic huffman coding
- Generating a canonical prefix encoding
- Integrated encryption in dynamic arithmetic compression
- On Information and Sufficiency
- Parallel Huffman Decoding with Applications to JPEG Files
- Pattern matching in Huffman encoded texts
- Robust universal complete codes for transmission and compression
- Variations on a theme by Huffman
This page was built for publication: Synchronizing dynamic Huffman codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611048)