scientific article
From MaRDI portal
Publication:3719826
zbMATH Open0591.68043MaRDI QIDQ3719826
Publication date: 1985
Title of this publication is not available (Why is that?)
operationHuffman algebraminimum redundancy codeslinearly ordered set with a commutative binarymultiset of elements in a Huffman algebrasmallest expression on a given
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Theory of error-correcting codes and error-detecting codes (94B99) Ordered rings, algebras, modules (06F25) Algorithms in computer science (68W99)
Related Items (1)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A memory-efficient and fast Huffman decoding algorithm 👍 👎
- Huffman coding in bit-vector compression 👍 👎
- Huffman Redundancy for Large Alphabet Sources 👍 👎
- A fast algorithm for optimal length-limited Huffman codes 👍 👎
- Algorithm 673 👍 👎
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 Q3719826)
