scientific article; zbMATH DE number 3476581
From MaRDI portal
Publication:4060381
Cited in
(11)- The \(S\)-digraph optimization problem and the greedy algorithm
- Minimax trees in linear time with applications
- Weighted forward looking adaptive coding
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Exact and approximation algorithms for error-detecting even codes
- Parity codes
- Forward looking Huffman coding
- A fast dynamic compression scheme for natural language texts
- Synchronizing dynamic Huffman codes
- Simple worst-case optimal adaptive prefix-free coding
- Dynamic Shannon coding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060381)