Algorithmic counting of nonequivalent compact Huffman codes
From MaRDI portal
Publication:6631554
DOI10.1007/S00200-022-00593-0MaRDI QIDQ6631554
Clemens Heuberger, Christian Elsholtz, Daniel Krenn
Publication date: 1 November 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Combinatorial codes (94B25) Rational numbers as sums of fractions (11D68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Level number sequences for trees
- Fast multiplication of large numbers
- Integer multiplication in time \(O(n\log n)\)
- Introduction to algorithms
- Fast integer multiplication using modular arithmetic
- The On-Line Encyclopedia of Integer Sequences
- Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
- The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
- Faster Integer Multiplication
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
- Generating Huffman sequences
- Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Generation and enumeration of all solutions of the characteristic sum condition
- Fast Library for Number Theory: An Introduction
This page was built for publication: Algorithmic counting of nonequivalent compact Huffman codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631554)
