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

A new method for coding theory by third order jacobsthal sequence

* ,

* Corresponding author · click or hover a name for details

pp. 1267–1278Vol. 29Issue 3March 2026DOI: 10.47974/JDMSC-2233 Crossmark XML
Received:
08 May 2024
Published Online:
28 Jul 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2233
Pages:
1267–1278

Abstract

In this paper, we describe a coding/decoding algorithm by third order Jacobsthal and Jacobsthal-Lucas matrix sequences. In this method the blocked message matrices are based on. In this method it is used that the encryption of  each message matrix use a different key. Therefore, the method is more secure. Of course, it is an important advantage using this method.

Keywords

Subject Classifications

68P3011B8311B3915B9911B5011B3714G5011T71

References

[1] M. Basu and B. Prasad, “The generalized relations among the code elements for Fibonacci coding theory,” Chaos Solitons Fractals, vol. 41, no. 5, pp. 2517–2525 (2009), doi: 10.1016/j.chaos.2008.09.030.
[2] M. Basu and M. Das, “Tribonacci matrices and a new coding theory,” Discrete Math. Algorithms Appl., vol. 6, no. 1, p. 1450008 (2014), doi: 10.1142/S1793830914500086.
[3] M. Basu and M. Das, “Coding theory on Fibonacci n-step numbers,” Discrete Math. Algorithms Appl., vol. 6, no. 2, p. 1450017 (2014), doi: 10.1142/S1793830914500177.
[4] M. Esmaeili and M. Esmaeili, “Fibonacci-polynomial based coding method with error detection and correction,” Comput. Math. Appl., vol. 60, no. 10, pp. 2738–2752 (2010).
[5] G. C. Morales, “On the third-order Jacobsthal and third-order Jacobsthal–Lucas sequences and their matrix representations,” Mediterr. J. Math., pp. 16–32 (2019), doi: 10.1007/s00009-019-1319-9.
[6] B. Prasad, “Coding theory on Lucas p-numbers,” Discrete Math. Algorithms Appl., vol. 8, no. 4, 17 pages (2016).
[7] J. Shtayat and A. Al-Kateeb, “The Perrin R-matrix and more properties with an application,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 1, pp. 41–52 (2022), doi: 10.1080/09720529.2020.1866299.
[8] A. P. Stakhov, “Fibonacci matrices, a generalization of the Cassini formula and a new coding theory,” Chaos Solitons Fractals, vol. 30, no. 1, pp. 56–66 (2006).
[9] A. Stakhov, V. Massingue, and A. Sluchenkov, Introduction into Fibonacci Coding and Cryptography. Kharkov, Ukraine: Osnova (1999).
[10] N. Tas, S. Ucar, N. Y. Ozgur, and O. O. Kaymak, “A new coding/decoding algorithm using Fibonacci numbers,” Discrete Math. Algorithms Appl., vol. 2, p. 1850028 (2018).
[11] M. Tahghighi, A. R. Jafaar, and A. R. Mahmod, “Generalization of Golden Cryptography based on k-Fibonacci numbers,” presented at the Int. Conf. Information and Network Communication (ICINC) (2010).
[12] S. Uçar and N. Y. Ozgur, “Right circulant matrices with generalized Fibonacci and Lucas polynomials and coding theory,” J. BAUN Inst. Sci. Technol., vol. 21, no. 1, pp. 306–322 (2019).
[13] S. Uçar, N. Tas, and N. Y. Özgür, “A new application to coding theory via Fibonacci and Lucas numbers,” Math. Sci. Appl. e-Notes, vol. 7, no. 1, pp. 62–70 (2019).

Views: 72Downloads: 7Citations: 0