相关论文: Fibonacci connection between Huffman codes and Wyt…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…
Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…
This paper defines the set fib of fibbinary numbers and displays its structure in the form of a table of a specialised type, and in array form. It uses the Zeckendorf representation $n \in \mathbf{N}$ to define a bijection $\mathcal{Z}$…
In this paper, we generalize a lot of facts from John Conway and Alex Ryba's paper, \textit{The extra Fibonacci series and the Empire State Building}, where we replace the Fibonacci sequence with the Tribonacci sequence. We study the…
A canonical Huffman sequence is characterized by a zero inner-product between itself and each of its shifted copies, except at their largest relative shifts: their aperiodic auto-correlation then becomes delta-like, a single central peak…
Finite discrete Huffman sequences, together with their extension to n-dimensional arrays, are highly valued because their discrete aperiodic auto-correlations optimally approximate the continuum form of the delta function. We present here…
Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.
A skeleton Huffman tree is a Huffman tree in which all disjoint maximal perfect subtrees are shrunk into leaves. Skeleton Huffman trees, besides saving storage space, are also used for faster decoding and for speeding up Huffman-shaped…
We motivate the study of a certain class of random Fibonacci sequences - which we call continuous random Fibonacci sequences - by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for…
In this paper, we present a new method for determining the optimal pebbling number of a complete binary tree. This method reveals a curious connection between the optimal pebbling numbers of complete binary trees and the Conolly-Fox…
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
A finite subset of the natural numbers is weak-Schreier if $\min S \ge |S|$, strong-Schreier if $\min S>|S|$, and maximal if $\min S = |S|$. Let $M_n$ be the number of weak-Schreier sets with $n$ being the largest element and $(F_n)_{n\geq…
In this paper, we give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the nth Fibonacci number can be calculated without having any knowledge about the previous…
The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy…