Skip to main content
SpringerLink
Log in

Huffman codes and maximizing properties of Fibonacci numbers

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A contrast Huffman code (of maximum length) and the corresponding contrast sequence of positive numbers are considered. A maximizing contrast sequence, the maximum cost of a contrast Huffman code, and their relationship with Fibonacci numbers are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. B. Vinokur, “Huffman trees and Fibonacci numbers,” Kibernetika, No. 6, 9–12 (1986).

    Google Scholar 

  2. D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE,40, 1098–1101 (Sept. 1952).

    Google Scholar 

  3. D. Knuth, The Art of Computer Programming, Vol. 1, Basic Algorithms [Russian translation], Mir, Moscow (1976).

    Google Scholar 

  4. N. N. Vorob'ev, Fibonacci Numbers [in Russian], Nauka, Moscow (1984).

    Google Scholar 

Download references

Authors
  1. A. B. Vinokur
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 10–15, May–June, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vinokur, A.B. Huffman codes and maximizing properties of Fibonacci numbers. Cybern Syst Anal 28, 329–334 (1992). https://doi.org/10.1007/BF01125413

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01125413

Keywords

Search

Navigation