<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-1726</article-id>
      <title-group>
        <article-title>Generalized k–step Jacobsthal numbers coding and decoding method </article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Yadav</surname>
            <given-names>Arun Kumar</given-names>
          </name>
          <aff>Department of Mathematics, Indira Gandhi University, Meerpur - Rewari, Haryana, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Pruthi</surname>
            <given-names>Manju</given-names>
          </name>
          <aff>Department of Mathematics, Indira Gandhi University, Meerpur - Rewari, Haryana, India</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>6</issue>
      <fpage>1773</fpage>
      <lpage>1799</lpage>
      <pub-date date-type="pub">
        <day>30</day>
        <month>09</month>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Jacobsthal numbers</kwd>
        <kwd>Coding-decoding</kwd>
        <kwd>Recurrence relation</kwd>
        <kwd>Error correction</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
