Pages that link to "Item:Q1249555"
From MaRDI portal
The following pages link to Huffman coding in bit-vector compression (Q1249555):
Displaying 11 items.
- An efficient finite-state machine implementation of Huffman decoders (Q293146) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Text compression methods (Q805263) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- An efficient bitwise Huffman coding technique based on source mapping. (Q1404449) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Adaptive succinctness (Q2118203) (← links)
- COMBAT: a new bitmap index coding algorithm for big data (Q2825257) (← links)
- Binary Huff Curves (Q3073716) (← links)
- (Q3719826) (← links)
- Binary Huffman equivalent codes with a short synchronizing codeword (Q4392468) (← links)