On the construction of reversible DNA codes over <i>F</i> <i>42m</i> via <i>T</i>n-set codes
Creators
- 1. Karamanoglu Mehmetbey Univ, Dept Math, TR-70100 Karaman, Turkiye
- 2. Princess Nourah Bint Abdulrahman Univ, Coll Sci, Dept Math Sci, POB 84428, Riyadh 11671, Saudi Arabia
- 3. Aligarh Muslim Univ, Dept Math, Aligarh 202002, India
- 4. Univ Malaya, Fac Sci, Inst Math Sci, Kuala Lumpur 50603, Malaysia
Description
The main objective of this paper is to introduce a new approach for constructing reversible and reversible DNA codes over the finite fields F42m, m >= 1 from any given polynomials by utilizing Tn-set codes. Notably, these polynomials are not required to be self-reciprocal divisors of xn-1. In addition to this method, we provide some results that demonstrate how to generate reversible and reversible DNA codes from any [n, k, d]-cyclic codes over F42m by applying Tn-set codes. Moreover, this approach allows us to determine a lower bound for the distance before completing the entire calculation process. We also construct a correspondence table between DNA sequences made up of 20-bases and all 256 elements of the linear code (Tg5 | T5(g*)degrees 4i over F16, where g = w13 + x + w2x2 + w3x3 is a polynomial in x over F16 and (g*)degrees 4 represents the Hadamard 4th-power of the reciprocal polynomial g* to demonstrate the fact that non-reversible codes may correspond to reversible DNA codes. Additionally, we provide a detailed table presenting some outcomes related to l-MDS codes, self-orthogonal codes, and their associated parameters.
Files
bib-1cddc9ee-5dde-4c1a-bfae-aa9eae0f6882.txt
Files
(199 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:5561b7a89c40b03e82c6f46ed2d732a9
|
199 Bytes | Preview Download |