Binary trees with choosable edge lengths

DOI10.1016/J.IPL.2009.07.002zbMATH Open1200.68173OpenAlexW1977899544MaRDI QIDQ989581FDOQ989581

Authors: Jens Maßberg, Dieter Rautenbach 

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

Recommendations

• Generalized Huffman coding for binary trees with choosable edge lengths
• A family of random trees with random edge lengths
• Left and right length of paths in binary trees
• Maximal path length of binary trees
• Left and right length of paths in binary trees or on a question of Knuth

zbMATH Keywords

cryptographydepthcombinatorial problemsbinary treeKraft's inequality

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The repeater tree construction problem
• Two inequalities implied by unique decipherability
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Optimum lopsided binary trees

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989581)