Work

On LCP and checkable group codes over finite non-commutative Frobenius rings

Year: 2025

Type: article

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

Source: Journal of Discrete Mathematical Sciences and Cryptography

DOI: 10.47974/jdmsc-2187

Authors: Sanjit Bhowmick, Javier de la Cruz, Edgar Martınez-Moro, Anuradha Sharma

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Commission, Agencia Estatal de Investigación

Awards: G1502225866, G3480869486, G7084143925

OpenAlex ID: W4409569286

FWCI:

Cites:

Cited by:

Related to: 10