Cyclic codes over non-chain ring R(α1, α2, ... , αs) and their applications to quantum and DNA codes
Let s >= 1 be a fixed integer. In this paper, we focus on generating cyclic codes over the ring R(alpha(1), alpha(2), ... , alpha(s)), where alpha(i) is an element of F-q\textbackslash{0}, 1 <= i <= s, by using the Gray map that is defined by the idempotents. Moreover, we describe the proce...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
AIMS Press
2024
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/45838/ https://doi.org/10.3934/math.2024358 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let s >= 1 be a fixed integer. In this paper, we focus on generating cyclic codes over the ring R(alpha(1), alpha(2), ... , alpha(s)), where alpha(i) is an element of F-q\textbackslash{0}, 1 <= i <= s, by using the Gray map that is defined by the idempotents. Moreover, we describe the process to generate an idempotent by using the formula (2.1). As applications, we obtain both optimal and new quantum codes. Additionally, we solve the DNA reversibility problem by introducing F-q reversibility. The aim to introduce the F-q reversibility is to describe IUPAC nucleotide codes, and consequently, 5 IUPAC DNA bases are considered instead of 4 DNA bases (A, T, G, C). |
|---|