Bounds on the Number of Huffman and Binary-Ternary Trees

Type: Preprint

Publication Date: 2013-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1303.5134

Locations

  • arXiv (Cornell University) - View
  • DataCite API - View

Similar Works

Action Title Year Authors
+ Abstract Huffman Coding and PIFO Tree Embeddings 2023 Keri D’Angelo
Dexter Kozen
+ Space-efficient Huffman codes revisited 2022 Szymon Grabowski
Dominik Köppl
+ PDF Chat Abstract Huffman Coding and PIFO Tree Embeddings 2023 Keri D’Angelo
Dexter Kozen
+ PDF Chat Generalized Huffman coding for binary trees with choosable edge lengths 2014 Jens MaĂźberg
+ Space-Efficient Huffman Codes Revisited 2021 Szymon Grabowski
Dominik Köppl
+ Novel Results on the Number of Runs of the Burrows-Wheeler-Transform 2020 Sara Giuliani
Shunsuke Inenaga
Zsuzsanna Lipták
Nicola Prezza
Marinella Sciortino
Anna Toffanello
+ Novel Results on the Number of Runs of the Burrows-Wheeler-Transform 2020 Sara Giuliani
Shunsuke Inenaga
Zsuzsanna Lipták
Nicola Prezza
Marinella Sciortino
Anna Toffanello
+ Binary Trees 2024
+ Binary Trees 2003 SANGWOOK KIM
+ Number of Binary Trees 1981 Will D. Gillett
+ Run-Length Encoding in a Finite Universe 2019 Niklas Larsson
+ Run-Length Encoding in a Finite Universe 2019 Niklas Larsson
+ Twenty (or so) Questions: $D$-ary Bounded-Length Huffman Coding 2006 Michael B. Baer
+ 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
+ On the loopless generation of binary tree sequences 1998 Vincent Vajnovszki
+ 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 Alphabetic Ternary Trees 2014 J. David Morgenthaler
T. C. Hu
+ Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding 2006 Michael B. Baer

Works That Cite This (0)

Action Title Year Authors