scientific article; zbMATH DE number 1091469

zbMATH Open0905.94017MaRDI QIDQ4367170FDOQ4367170

Authors:

Publication date: 4 February 1999

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 436071
• Forward looking Huffman coding
• Forward looking Huffman coding
• Design and analysis of dynamic Huffman codes
• scientific article; zbMATH DE number 2170434

zbMATH Keywords

Huffman's treestatic Huffman encoding

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (8)

• A nearly-optimal Fano-based coding algorithm
• Title not available (Why is that?)
• Generalized Huffman coding for binary trees with choosable edge lengths
• Huffman coding in bit-vector compression
• Forward looking Huffman coding
• Housekeeping for prefix coding
• Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
• Title not available (Why is that?)

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)