scientific article; zbMATH DE number 1091469
From MaRDI portal
Publication:4367170
Recommendations
Cited in
(8)- Housekeeping for prefix coding
- A nearly-optimal Fano-based coding algorithm
- scientific article; zbMATH DE number 4041776 (Why is no real title available?)
- scientific article; zbMATH DE number 436071 (Why is no real title available?)
- Generalized Huffman coding for binary trees with choosable edge lengths
- Huffman coding in bit-vector compression
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
- Forward looking Huffman 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 Q4367170)