Binary trees with choosable edge lengths

DOI10.1016/j.ipl.2009.07.002zbMath1200.68173OpenAlexW1977899544MaRDI QIDQ989581

Dieter Rautenbach, Jens Maßberg

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.002

zbMATH Keywords

binary treecryptographycombinatorial problemsdepthKraft's inequality

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data encryption (aspects in computer science) (68P25)

Related Items (2)

The repeater tree construction problem ⋮ Generalized Huffman coding for binary trees with choosable edge lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic theory for recurrence relations based on minimization and maximization.
• The repeater tree construction problem
• Optimum lopsided binary trees
• Two inequalities implied by unique decipherability

This page was built for publication: Binary trees with choosable edge lengths