The following pages link to Dynamic huffman coding (Q3745760):
Displayed 16 items.
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Dynamic Shannon coding (Q845979) (← 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)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Lossless image compression based on multiple-tables arithmetic coding (Q1036264) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- Block Huffman coding (Q1879563) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- A fast and efficient nearly-optimal adaptive Fano coding scheme (Q2489208) (← links)
- Efficient algorithms for online decision problems (Q2568459) (← links)
- Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
- Parity codes (Q4680739) (← links)
- Optimal binary search trees (Q5906917) (← links)