On LCP and checkable group codes over finite non-commutative Frobenius rings
We provide a simple proof for a complementary pair of group codes over a finite noncommutative 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.
Authors
- Javier de la Cruz (ORCID: https://orcid.org/0000-0003-3609-9148)
- Sanjit Bhowmick
- Edgar Martı́nez-Moro (ORCID: https://orcid.org/0000-0003-1243-2049)
- Anuradha Sharma (ORCID: https://orcid.org/0000-0002-0133-8658)
Publication Details
- Journal
- Journal of Discrete Mathematical Sciences and Cryptography
- Published
- 2025-01-01
- DOI
- https://doi.org/10.47974/jdmsc-2187
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00