Bidirectional adaptive compression
From MaRDI portal
Publication:2689643
Recommendations
Cites work
- A Method for the Construction of Minimum-Redundancy Codes
- A space efficient direct access data structure
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- Compressed matching for feature vectors
- Compressed matching in dictionaries
- COMPRESSED PATTERN MATCHING IN JPEG IMAGES
- Data compression via textual substitution
- Design and analysis of dynamic Huffman codes
- Evaluation of parallel text alignment systems -- the ARCADE project
- Forward looking Huffman coding
- scientific article; zbMATH DE number 3738962 (Why is no real title available?)
- scientific article; zbMATH DE number 742992 (Why is no real title available?)
- Integrated encryption in dynamic arithmetic compression
- New approaches for context sensitive flash codes
- Random access to Fibonacci encoded files
- Universal codeword sets and representations of the integers
Cited in
(9)- Block Huffman coding
- Weighted forward looking adaptive coding
- Improving dictionary based data compression by using previous knowledge and interaction
- Schemes for Bidirectional Modeling of Discrete Stationary Sources
- scientific article; zbMATH DE number 49083 (Why is no real title available?)
- Bidirectional Huffman coding
- Bidirectional Text Compression in External Memory
- Forward looking Huffman coding
- Forward looking Huffman coding
This page was built for publication: Bidirectional adaptive compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689643)