<?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-2187</article-id>
      <title-group>
        <article-title>On LCP and checkable group codes over finite non-commutative Frobenius rings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Bhowmick</surname>
            <given-names>Sanjit</given-names>
          </name>
          <aff>Department of Mathematics, Indraprastha Institute of Information Technology Delhi, New Delhi, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Cruz</surname>
            <given-names>Javier de la</given-names>
          </name>
          <aff>Departamento de Matemáticas, Universidad del Norte, Barranquilla, Colombia</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Martı­nez-Moro</surname>
            <given-names>Edgar</given-names>
          </name>
          <aff>Institute of Mathematics, University of Valladolid, Castilla, Spain</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sharma</surname>
            <given-names>Anuradha</given-names>
          </name>
          <aff>Department of Mathematics, Indraprastha Institute of Information Technology Delhi, New Delhi, India</aff>
        </contrib>
      </contrib-group>
      <volume>28</volume>
      <issue>3</issue>
      <fpage>891</fpage>
      <lpage>905</lpage>
      <pub-date date-type="pub">
        <day>11</day>
        <month>04</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact for checkeable codes over the same type of alphabet.</p>
      </abstract>
      <kwd-group>
        <kwd>Group codes</kwd>
        <kwd>Non-commutative Frobenius ring</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>
