Huffman coding in bit-vector compression
From MaRDI portal
Recommendations
Cited in
(11)- The use and usefulness of numeration systems
- An efficient bitwise Huffman coding technique based on source mapping.
- Robust universal complete codes for transmission and compression
- Adaptive succinctness
- COMBAT: a new bitmap index coding algorithm for big data
- An efficient finite-state machine implementation of Huffman decoders
- Binary Huff Curves
- scientific article; zbMATH DE number 3949708 (Why is no real title available?)
- Binary Huffman equivalent codes with a short synchronizing codeword
- Is Huffmann coding dead?
- Text compression methods
This page was built for publication: Huffman coding in bit-vector compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249555)