Algorithmic counting of nonequivalent compact Huffman codes

Christian Elsholtz, Clemens Heuberger, Daniel Krenn

Type: Preprint

Publication Date: 2019-01-31

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Algorithmic counting of nonequivalent compact Huffman codes	2023	Christian Elsholtz Clemens Heuberger Daniel Krenn
+ PDF Chat	The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions	2012	Christian Elsholtz Clemens Heuberger Helmut Prodinger
+	Bounds on the Number of Huffman and Binary-Ternary Trees	2013	Angeline Rao Ying Liu Yezhou Feng Jian Shen
+	Optimal Prefix Free Code in Linear Time	2012	Jérémy Barbay
+	Optimal Prefix Free Code in Linear Time	2012	Jérémy Barbay
+	Optimal Prefix Free Code: word-RAM Linear and Algebraic Instance Optimal	2012	Jérémy Barbay
+	A note on Prüfer-like coding and counting forests of uniform hypertrees	2011	Christian Lavault
+	Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm	2023	Nadime Francis Victor Marsault
+ PDF Chat	Efficient and compact representations of some non-canonical prefix-free codes	2022	Antonio Fariña Travis Gagie Szymon Grabowski Giovanni Manzini Gonzalo Navarro Alberto Ordóñez
+ PDF Chat	Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes	2016	Antonio Fariña Travis Gagie Giovanni Manzini Gonzalo Navarro Alberto Ordóñez
+ PDF Chat	Compact integers and factorials	2007	Vladimir Shevelev
+	Optimal Alphabetic Ternary Trees	2014	J. David Morgenthaler T. C. Hu
+	Arithmetic Algorithms for Hereditarily Binary Natural Numbers	2013	Paul Tarau
+	Arithmetic Algorithms for Hereditarily Binary Natural Numbers	2013	Paul Tarau
+	Exact Enumerations	2009	I. G. Enting Iwan Jensen
+	Optimal enumerations and optimal gödel numberings	1974	C. P. Schnorr
+	The numbers of powers in the Tribonacci sequence	2016	Yuke Huang Zhi‐Ying Wen
+	Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes	2005	Brad Jackson Frank Ruskey
+	Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct	2005	A. Belal Amr Elmasry
+	Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct	2005	Ahmed Belal Amr Elmasry

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (5)

Action	Title	Year	Authors
+ PDF Chat	Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi	1989	Jonathan M. Borwein Peter Borwein David H. Bailey
+ PDF Chat	The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions	2012	Christian Elsholtz Clemens Heuberger Helmut Prodinger
+	Level number sequences for trees	1987	Philippe Flajolet Helmut Prodinger
+	Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions	2013	Clemens Heuberger Daniel Krenn Stephan Wagner
+	What is an answer? - remarks, results and problems on PIO formulas in combinatorial enumeration, part I	2018	Martin Klazar