The following pages link to Data compression (Q3792615):
Displaying 14 items.
- An efficient raster font compression for embedded systems (Q609148) (← links)
- Superlinear period lengths in some subtraction games (Q672382) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- An adaptive character wordlength algorithm for data compression (Q931760) (← links)
- A novel lossless data compression scheme based on the error correcting Hamming codes (Q950036) (← links)
- Efficient coding of formalized messages (Q1816135) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Invariant characterizations of fuzzy information systems under some homomorphisms based on data compression and related results (Q2329095) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- Tree-traversing ant algorithm for term clustering based on featureless similarities (Q2462880) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- In-place calculation of minimum-redundancy codes (Q5057451) (← links)
