Skew cyclic codes over 𝔽qR
In this paper, we study the algebraic structure of [Formula: see text]-skew cyclic codes, where [Formula: see text] denotes the ring [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text]. We determine generator polynomials for [Formula: see text]-skew cyclic codes and generator idempotents for separable codes. We also give conditions for the dual of a [Formula: see text]-skew cyclic code to be another [Formula: see text]-skew cyclic code. We introduce a Gray map from [Formula: see text] to [Formula: see text] where [Formula: see text] and [Formula: see text] are non-negative integers. As an application, we construct quantum codes from these codes.
Authors
- Nabil Bennenni (ORCID: https://orcid.org/0000-0002-4656-8190)
- Nuh Aydın (ORCID: https://orcid.org/0000-0002-5618-2427)
- Aicha Batoul (ORCID: https://orcid.org/0000-0003-1534-4554)
- Amina Delhoum
Institutions
- University of Sciences and Technology Houari Boumediene (DZ)
- Kenyon College (US)
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2025-10-31
- DOI
- https://doi.org/10.1142/s1793830925501605
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00