Pages that link to "Item:Q3778663"
From MaRDI portal
The following pages link to Design and analysis of dynamic Huffman codes (Q3778663):
Displayed 15 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)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- An adaptive character wordlength algorithm for data compression (Q931760) (← links)
- Dynamic asymmetric communication (Q975489) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- An efficient decoding technique for Huffman codes (Q1603588) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- A fast and efficient nearly-optimal adaptive Fano coding scheme (Q2489208) (← links)
- Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- Optimal synchronous coding (Q4828660) (← links)