Binary trees with choosable edge lengths

DOI10.1016/J.IPL.2009.07.002MaRDI QIDQ989581zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Optimum lopsided binary trees
• The repeater tree construction problem
• Two inequalities implied by unique decipherability

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)