Huffman codes and maximizing properties of Fibonacci numbers

DOI10.1007/BF01125413MaRDI QIDQ1816132zbMATH OpenFDO

Authors A. B. Vinokur

Publication date 6 January 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

contrast sequenceFibonacci numbersHuffman code

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Arithmetic codes (94B40)

Recommendations

• Huffman trees and fibonacci numbers
• Maximal codeword lengths in Huffman codes
• On the maximum length of Huffman codes
• Maximum versus minimum: two properties of the Fibonacci sequence
• scientific article; zbMATH DE number 775615

Cites work

• A Method for the Construction of Minimum-Redundancy Codes

Cited in

(5)

• Simple bounds on the numbers of binary Huffman sequences
• On the weakly superincreasing distributions and the Fibonacci-Hessenberg matrices.
• Huffman trees and fibonacci numbers
• scientific article; zbMATH DE number 510653 (Why is no real title available?)
• scientific article; zbMATH DE number 1919513 (Why is no real title available?)

This page was built for publication: Huffman codes and maximizing properties of Fibonacci numbers

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