TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Generalized k–step Jacobsthal numbers coding and decoding method 

* ,

* Corresponding author · click or hover a name for details

pp. 1773–1799Vol. 26Issue 6September 2023DOI: 10.47974/JDMSC-1726 Crossmark XML
Received:
10 Aug 2022
Accepted:
06 Dec 2022
Published Online:
30 Sep 2023
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1726
Pages:
1773–1799

Abstract

In this article, we create a coding/decoding method utilizing the generalized k-step Jacobsthal numbers and the relation between the components of the code matrix and error detection and correction have been established for all value of k. The method’s accuracy is 93.33 percent for k = 2, the method’s accuracy is 99.80 percent for k = 3 and the method accuracy is 99.998 percent for n = 4. In general, the accuracy of the approach improves with each successively higher value of n. We give two examples of generalized k – step jacobsthal sequences via blocking algorithm and solve these illustrations using python.

Keywords

Subject Classifications

11B3711B3911B8311C2094B

References

[1] Al-Kateeb A., Generalization of Jacobsathal and Jacobsathal Lucas Number (2020). https://www.researchgate.net/publication/336086490.
[2] Basu, M., Prasad B., Coding theory on the m-extension of the Fibonacci p-numbers, Chaos, Solutions, and Fractals 42, 2522-2530, (2009).
[3] Basu, M., Das, M., Coding theory on Fibonacci n-step numbers, Discrete Mathematics, Algorithms and Application, Vol. 6, No. 2, 1450017 (2014).
[4] Basu, M., Das, M., Coding theory on generalized Fibonacci n-step polynomials, Journal of Information and Optimization Sciences, Vol. 38, No.1, 83-13 (2017).
[5] Esmaeili M., Esmaeili M., A Fibonacci-polynomial based coding method with error detection and correction, Computers & Mathematics with Applications, Vol. 60, Issue 10, 2738-2752, (2010).
[6] F. Qi, “Determinantal expressions and recurrence relations for Fubini and Eulerian polynomials,” J. Interdiscip. Math., vol. 22, no. 3, pp. 317–335 (2019), doi: 10.1080/09720502.2019.1624063.
[7] Sundarayya P., Vara Prasad. M.G., Coding theory on Pell-Lucas p numbers, IOP Conf. Series: Journal of Physics: conf. series 1344 (2019).
[8] Stakhov A., Massingue V., Sluchenkova A., “Introduction into Fibonacci Coding and Cryptography, (1999).
[9] Tas N., Ucar S., Ozgur N.: Pell Coding and Pell Decoding Methods with Some Applications, Contributions of Discrete Mathematics, Vol. 15, No. 1, 52–66 (2020).
[10] Tas N., Ucar S., Ozgur Y.,Kaymak O., A new coding/decoding algorithm using Fibonacci numbers, Discrete Mathematics Algorithms and Applications, (2017).
[11] Ucar S., Tas N., Ozgur N. Y., A new cryptography model via Fibonacci and Lucas numbers, Mathematical Sciences and Applications E-Notes, (2019). Doi: 10.36753/mathenot.559251. 
[12] Yilmaz F., Bozkurt D., The generalized order –k Jacobsthal numbers, Int. J. Comtemp. Math and Sciences, vol. 4, no. 34, 1685-1694 (2009).

Views: 143Downloads: 7Citations: 0