On LCP mixed-alphabet group codes over finite chain rings
In this paper, we determine a standard generator matrix for any mixed-alphabet linear code over finite chain rings and study under which conditions the codes [Formula: see text] and [Formula: see text] in a linear complementary pair (LCP) of mixed-alphabet linear codes are weakly-free. It is also proved that if and only if the pair [Formula: see text] of separable mixed-alphabet group code is LCP, then [Formula: see text] and the [Formula: see text] are permutation equivalent.
Authors
- Javier de la Cruz (ORCID: https://orcid.org/0000-0003-3609-9148)
- Edgar Martı́nez-Moro (ORCID: https://orcid.org/0000-0003-1243-2049)
- Maryam Bajalan (ORCID: https://orcid.org/0000-0003-3828-825X)
- Alexandre Fotue Tabue
Institutions
- Universidad de Valladolid (ES)
- Universidad del Norte (CO)
- University of Maroua (CM)
- Bulgarian Academy of Sciences (BG)
- Institute of Mathematics and Informatics (BG)
- Technological Institute of Castilla y León (ES)
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2025-03-26
- DOI
- https://doi.org/10.1142/s1793830925500648
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00