Generalized k–step Jacobsthal numbers coding and decoding method

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete mathematical sciences & cryptography Vol. 26; no. 6; pp. 1773 - 1799
Main Authors Yadav, Arun Kumar, Pruthi, Manju
Format Journal Article
LanguageEnglish
Published 2023
Online AccessGet full text
ISSN0972-0529
2169-0065
DOI10.47974/JDMSC-1726

Cover

More Information
Summary: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.
ISSN:0972-0529
2169-0065
DOI:10.47974/JDMSC-1726