Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Fibonacci coding"'
Autor:
Suleyman Aydinyuz, Mustafa Asci
Publikováno v:
Mathematical Biosciences and Engineering, Vol 20, Iss 2, Pp 1993-2010 (2023)
In this study, the coding theory defined for k-order Gaussian Fibonacci polynomials is rearranged by taking $ x = 1 $. We call this coding theory the k-order Gaussian Fibonacci coding theory. This coding method is based on the $ {Q_k}, {R_k} $ and $
Externí odkaz:
https://doaj.org/article/de73ffc7165e44d8a56c931284488c43
Autor:
Suleyman Aydinyuz, Mustafa Asci
Publikováno v:
Mathematical Biosciences and Engineering. 20:1993-2010
In this study, the coding theory defined for k-order Gaussian Fibonacci polynomials is rearranged by taking \begin{document}$ x = 1 $\end{document}. We call this coding theory the k-order Gaussian Fibonacci coding theory. This coding method is based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b1414a2fd181fedca8906ae875b4bba
https://doi.org/10.3934/mbe.2023092
https://doi.org/10.3934/mbe.2023092
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 22:943-952
A new notion, called generalized k-sequence, which is a sequence satisfying a second order linear recurrence with coefficients depending on two independent parameters, is introduced. The se...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58d217ac088afe4c9d516a76a734eddc
https://doi.org/10.1080/09720529.2019.1627071
https://doi.org/10.1080/09720529.2019.1627071
Autor:
Pavel Trojovský, Ivana Matoušová
Publikováno v:
Mathematics, Vol 8, Iss 2058, p 2058 (2020)
Mathematics
Volume 8
Issue 11
Mathematics
Volume 8
Issue 11
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&rsquo
s papers have motivated many other scientists to seek certa
s papers have motivated many other scientists to seek certa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12e32f2865a8b200ccba2cf105052cb9
https://www.mdpi.com/2227-7390/8/11/2058
https://www.mdpi.com/2227-7390/8/11/2058
Autor:
Suleyman Aydinyuz, Mustafa Asci
In this paper we introduce and study k-order Gaussian Fibonacci Coding Theory. We give illustrative examples about coding theory. This coding theory is a method bound to the Q_k, R_k and E_n^(k) matrices. This coding/decoding method is different from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1df143b1582df183c351e4842a749822
https://doi.org/10.22541/au.159895627.73622599
https://doi.org/10.22541/au.159895627.73622599
Publikováno v:
International Journal of Fluid Power.
A unique method of improving energy efficiency in fluid power systems is called digital flow control. In this paper, binary coding control is utilized. Although this scheme is characterized by a small package size and low energy consumption, it is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::126734b2d43d6eaf9d8ff8f96809d11c
https://doi.org/10.13052/ijfp1439-9776.2033
https://doi.org/10.13052/ijfp1439-9776.2033
Publikováno v:
DCC
The famous Fibonacci series defined by F_0= 0, F_1= 1 and F_i=F_i-1 + F_i-2, for i≥ 2, has contributed to several applications in Data Compression. Quite a few encodings have been suggested that are based on the properties of the Fibonacci sequence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b298854ddac242954e2f1fc5e3262056
https://doi.org/10.1109/dcc47342.2020.00060
https://doi.org/10.1109/dcc47342.2020.00060
Autor:
I. S. Sergeev
Publikováno v:
Problems of Information Transmission. 54:343-350
We show that converting an n-digit number from a binary to Fibonacci representation and backward can be realized by Boolean circuits of complexity O(M(n) log n), where M(n) is the complexity of integer multiplication. For a more general case of r-Fib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac8bb28cf50dcc874d4abaacff99dd1
https://doi.org/10.1134/s0032946018040038
https://doi.org/10.1134/s0032946018040038
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.