The Golden mean, Fibonacci matrices and partial weakly super-increasing sources

M. Esmaeili, T.A. Gulliver and A. Kakhbod

Chaos, Solitons & Fractals, 2009, vol. 42, issue 1, 435-440

Abstract: A source S={s1,s2,…}, with at least i+1 source symbols, having a binary Huffman code with codeword lengths satisfying l1=1,l2=2,…,li=i, is called an i-level partial weakly super-increasing (PWSI) source. Connections between these sources, Fibonacci matrices and the Golden mean are studied. It is shown that the Euclidean projection of the distributions associated with these sources is given by Fibonacci–Hessenberg matrices. While there is no upper bound on the expected codeword length of Huffman codes representing PWSI sources (and hence no upper bound on their entropy), the Fibonacci sequence and the Golden mean 1+52 provide a lower bound on the maximum expected codeword length of these codes.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077909000071
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:42:y:2009:i:1:p:435-440

DOI: 10.1016/j.chaos.2009.01.007

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().