Huffman trees and fibonacci numbers

DOI10.1007/BF01068684MaRDI QIDQ3804205zbMATH OpenOpenAlexFDO

Authors A. B. Vinokur

Publication date 1986

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01068684

zbMATH Keywords

binary treeFibonacci sequenceHuffman treesweighted path length

Mathematics Subject Classification ID

Recurrences (11B37) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Huffman codes and maximizing properties of Fibonacci numbers
• Minimal Huffman trees
• What Costs Are Minimized by Huffman Trees?
• Path Length of Binary Search Trees
• scientific article; zbMATH DE number 4031716

Cited in

(8)

• Huffman codes and maximizing properties of Fibonacci numbers
• Binary Huff Curves
• Simple bounds on the numbers of binary Huffman sequences
• On the weakly superincreasing distributions and the Fibonacci-Hessenberg matrices.
• scientific article; zbMATH DE number 4053622 (Why is no real title available?)
• scientific article; zbMATH DE number 96112 (Why is no real title available?)
• scientific article; zbMATH DE number 1175382 (Why is no real title available?)
• scientific article; zbMATH DE number 1471866 (Why is no real title available?)

This page was built for publication: Huffman trees and fibonacci numbers

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