DNA codes from $(\text{\textbaro}, \mathfrak{d}, γ)$-constacyclic codes over $\mathbb{Z}_4+ω\mathbb{Z}_4$
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910840015290368 |
|---|---|
| author | Sharma, Priyanka Singh, Ashutosh Prakash, Om |
| author_facet | Sharma, Priyanka Singh, Ashutosh Prakash, Om |
| contents | This work introduces a novel approach to constructing DNA codes from linear codes over a non-chain extension of $\mathbb{Z}_4$. We study $(\text{\textbaro},\mathfrak{d}, γ)$-constacyclic codes over the ring $\mathfrak{R}=\mathbb{Z}_4+ω\mathbb{Z}_4, ω^2=ω,$ with an $\mathfrak{R}$-automorphism $\text{\textbaro}$ and a $\text{\textbaro}$-derivation $\mathfrak{d}$ over $\mathfrak{R}.$ Further, we determine the generators of the $(\text{\textbaro},\mathfrak{d}, γ)$-constacyclic codes over the ring $\mathfrak{R}$ of any arbitrary length and establish the reverse constraint for these codes. Besides the necessary and sufficient criterion to derive reverse-complement codes, we present a construction to obtain DNA codes from these reversible codes. Moreover, we use another construction on the $(\text{\textbaro},\mathfrak{d},γ)$-constacyclic codes to generate additional optimal and new classical codes. Finally, we provide several examples of $(\text{\textbaro},\mathfrak{d}, γ)$ constacyclic codes and construct DNA codes from established results. The parameters of these linear codes over $\mathbb{Z}_4$ are better and optimal according to the codes available at \cite{z4codes}. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_10212 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | DNA codes from $(\text{\textbaro}, \mathfrak{d}, γ)$-constacyclic codes over $\mathbb{Z}_4+ω\mathbb{Z}_4$ Sharma, Priyanka Singh, Ashutosh Prakash, Om Information Theory 16S36, 92D20, 94B05, 94B15, 94B60 This work introduces a novel approach to constructing DNA codes from linear codes over a non-chain extension of $\mathbb{Z}_4$. We study $(\text{\textbaro},\mathfrak{d}, γ)$-constacyclic codes over the ring $\mathfrak{R}=\mathbb{Z}_4+ω\mathbb{Z}_4, ω^2=ω,$ with an $\mathfrak{R}$-automorphism $\text{\textbaro}$ and a $\text{\textbaro}$-derivation $\mathfrak{d}$ over $\mathfrak{R}.$ Further, we determine the generators of the $(\text{\textbaro},\mathfrak{d}, γ)$-constacyclic codes over the ring $\mathfrak{R}$ of any arbitrary length and establish the reverse constraint for these codes. Besides the necessary and sufficient criterion to derive reverse-complement codes, we present a construction to obtain DNA codes from these reversible codes. Moreover, we use another construction on the $(\text{\textbaro},\mathfrak{d},γ)$-constacyclic codes to generate additional optimal and new classical codes. Finally, we provide several examples of $(\text{\textbaro},\mathfrak{d}, γ)$ constacyclic codes and construct DNA codes from established results. The parameters of these linear codes over $\mathbb{Z}_4$ are better and optimal according to the codes available at \cite{z4codes}. |
| title | DNA codes from $(\text{\textbaro}, \mathfrak{d}, γ)$-constacyclic codes over $\mathbb{Z}_4+ω\mathbb{Z}_4$ |
| topic | Information Theory 16S36, 92D20, 94B05, 94B15, 94B60 |
| url | https://arxiv.org/abs/2412.10212 |