On Coding by (2,q)-Distance Fibonacci Numbers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F20%3A50017411" target="_blank" >RIV/62690094:18470/20:50017411 - isvavai.cz</a>
Result on the web
<a href="https://www.mdpi.com/2227-7390/8/11/2058" target="_blank" >https://www.mdpi.com/2227-7390/8/11/2058</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/math8112058" target="_blank" >10.3390/math8112058</a>

Result language
angličtina
Original language name
On Coding by (2,q)-Distance Fibonacci Numbers
Original language description
In 2006, A. Stakhov introduced a new coding/decoding process based on generating matrices of the Fibonacci p-numbers, which he called the Fibonacci coding/decoding method. Stakhov's papers have motivated many other scientists to seek certain generalizations by introducing new additional coefficients into recurrence of Fibonacci p-numbers. In 2013, I. Wloch et al. studied (2,q)-distance Fibonacci numbers F-2(q,n) and found some of their combinatorial properties. In this paper, we state a new coding theory based on the sequence (T-q(n))(n=-infinity)(infinity), which is an extension of Wloch's sequence (F-2(q,n))(n=0)(infinity).
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)