5 research outputs found

    Metode Reversible Self-Dual untuk Konstruksi Kode DNA atas Lapangan Hingga GF(4)

    Get PDF
    The DNA molecule chain consists of two complementary strands composed of a sequence of four nucleotide bases, namely adenine (A), cytosine (C), guanine (G) and thymine (T). DNA code is a set of codewords with a fixed length of the alphabet {A, C, T, G}. DNA coding is one application of coding theory over a finite field. The set {A, C, T, G} is identified as finite field GF(4) = {0, 1, w, w2} with w2 + w + 1 = 0. The reversible self-dual (RSD) code over the finite field GF(4) is a code whose dual is itself and the reverse of each codeword contained in the code. This study aims to obtain an algorithm to construct a DNA code derived from the RSD C code on the field to GF(4) which is called the Reversible Self-Dual Method. The aspects studied include the characteristics that form the basis properties of the theory in compiling the DNA code algorithm over the RSD code over GF(4). The compiled algorithm is a DNA code construction method of codeword length even that conforms to the Hamming distance constraint, reverse-complement constraint, and GC-content constraint. The input of the algorithm is a generator matrix of RSD code C with a minimum distance of d and the output is a DNA code that satisfies these three constraints

    Reversible DNA codes from skew cyclic codes over a ring of order 256

    Get PDF
    We introduce skew cyclic codes over the finite ring R\R, where u2=0,v2=v,w2=w,uv=vu,uw=wu,vw=wvu^{2}=0,v^{2}=v,w^{2}=w,uv=vu,uw=wu,vw=wv and use them to construct reversible DNA codes. The 4-mers are matched with the elements of this ring. The reversibility problem for DNA 4-bases is solved and some examples are provided

    Reversible DNA codes over F16 + uF16 + vF16 + uvF16

    No full text
    WOS:000401830400007In this paper we study the structure of specific linear codes called DNA codes. The first attempts on studying such codes have been proposed over four element rings which are naturally matched with DNA four letters. Later, double (pair) DNA strings or more general k-DNA strings called k-mers have been matched with some special rings and codes over such rings with specific properties are studied. However, these matchings in general are not straight-forward and because of the fact that the reverse of the codewords (k-mers) need to exist in the code, the matching problem is difficult and it is referred to as the reversibility problem. Here, 8-mers (DNA 8-bases) are matched with the ring elements of R-16 = F-16 + uF(16) + upsilon F-16 + u upsilon F-16. Furthermore, cyclic codes over the ring R-16 where the multiplication is taken to be noncommutative with respect to an automorphism theta are studied. The preference on the skewness is shown to be very useful and practical especially since this serves as a direct solution to the reversibility problem compared to the commutative approaches
    corecore