Generalized Huffman coding for binary trees with choosable edge lengths

Jens Maßberg

Type: Article

Publication Date: 2014-12-02

Citations: 3

DOI: https://doi.org/10.1016/j.ipl.2014.11.013

View Publication

Download PDF

Locations

Information Processing Letters - View
arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Binary trees with choosable edge lengths	2009	Jens Maßberg Dieter Rautenbach
+	Generalized acyclic edge colorings via entropy compression	2018	Laihao Ding Guanghui Wang Jianliang Wu
+	Bounds on the Number of Huffman and Binary-Ternary Trees	2013	Angeline Rao Ying Liu Yezhou Feng Jian Shen
+ PDF Chat	Alphabetic coding with exponential costs	2009	Michael B. Baer
+	Codings of graphs with binary edge labels	1994	Martin Aigner Eberhard Triesch
+	Couples Sequences of Generalized Fibonacci Trees and Unequal Costs Coding Problems	1997	Julia Abrahams
+ PDF Chat	Greedy construction of DNA codes and new bounds	2019	Nabil Bennenni Kenza Guenda T. Aaron Gulliver
+	Bounds on Generalized Huffman Codes	2007	Michael B. Baer
+ PDF Chat	Bijective Linear Time Coding and Decoding for k-Trees	2008	Saverio Caminiti Emanuele G. Fusco Rossella Petreschi
+	Coding and counting spanning trees in Kleitman-Golden graphs	1991	L. M. Koganov
+	Generalized Gray codes with prescribed ends	2017	Tomáš Dvořák Petr Gregor Vácłav Koubek
+	Restricted compositions and permutations: From old to new Gray codes	2011	V. Vajnovszki Rémi Vernay
+ PDF Chat	Abstract Huffman Coding and PIFO Tree Embeddings	2023	Keri D’Angelo Dexter Kozen
+ PDF Chat	Universal Slepian-Wolf Coding for Individual Sequences	2024	Neri Merhav
+	An Alternative to Huffman's Algorithm for Constructing Variable-Length Codes	2005	Olivier Rioul
+	Binary Trees	2024
+	Binary Trees	2003	SANGWOOK KIM
+ PDF Chat	Optimal Skeleton Huffman Trees Revisited	2020	Dmitry Kosolobov Oleg Merkurev
+ PDF Chat	Tilings of Benzels via Generalized Compression	2025	Colin Defant Leigh Foster Rupert Li James Propp Benjamin Young
+ PDF Chat	An efficiently generated family of binary de Bruijn sequences	2021	Yunlong Zhu Zuling Chang Martianus Frederic Ezerman Qiang Wang

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (2)

Action	Title	Year	Authors
+	Binary trees with choosable edge lengths	2009	Jens Maßberg Dieter Rautenbach
+ PDF Chat	Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme	2012	Mordecai J. Golin Claire Mathieu Neal E. Young