The following pages link to Variations on a theme by Huffman (Q4184761):
Displaying 26 items.
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Algorithmic information and simplicity in statistical physics (Q678643) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Text compression methods (Q805263) (← links)
- Lossless compression schemes for ECG signals using neural network predictors (Q836485) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- An efficient layered data compression scheme with constraint analysis (Q1010047) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
- Approximate counting: a detailed analysis (Q1057061) (← links)
- On the redundancy achieved by Huffman codes (Q1364502) (← links)
- Maximal codeword lengths in Huffman codes (Q1570107) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- Block Huffman coding (Q1879563) (← links)
- Weighted forward looking adaptive coding (Q2166764) (← links)
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991) (← 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)
- ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC (Q3728800) (← links)
- Parity codes (Q4680739) (← links)
- Optimal Skeleton Huffman Trees Revisited (Q5042248) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Forward looking Huffman coding (Q5918359) (← links)
- Generating probabilities with a specified entropy (Q5950720) (← links)
