Results 1 to 10 of about 74 (52)
On reversibility problem in DNA bases over a class of rings
Let [Formula: see text] be a non-chain ring of characteristic 4, where [Formula: see text] and [Formula: see text]. In this article, we discuss reversible cyclic codes of odd lengths over the ring [Formula: see text].
Mohammad Ashraf +2 more
exaly +3 more sources
Let q=pmq={p}^{m}, pp be an odd prime, and Rk=Fq[u1,u2,ā¦,uk]/āØui3=ui,uiuj=ujuiā©{R}_{k}={{\mathbb{F}}}_{q}\left[{u}_{1},{u}_{2},\ldots ,{u}_{k}]\hspace{-0.08em}\text{/}\hspace{-0.08em}\langle {u}_{i}^{3}={u}_{i},{u}_{i}{u}_{j}={u}_{j}{u}_{i}\rangle ...
Kong Bo, Zheng Xiying
doaj +1 more source
Codes over Hurwitz integers [PDF]
In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as Hurwitz metric. The codes with respect to Hurwitz metric use in coded modulation schemes based on quadrature amplitude ...
Murat Guzeltepe
semanticscholar +1 more source
DNA codes over finite local Frobenius non-chain rings of length 5 and nilpotency index 4
A one to one correspondence between the elements of a finite local Frobenius non-chain ring of length 5 and nilpotency index 4, and k-tuples of DNA codewords is established.
Castillo-GuillƩn C. A. +1 more
doaj +1 more source
Construction of reversible cyclic codes over š½q + uš½q + u2š½q
Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = š½q +uš½q + u2š½q, where u3 = 0 mod q.
Rehman Nadeem ur +2 more
doaj +1 more source
Self-Dual Cyclic Codes Over M2(ā¤4)
In this paper, we study the structure of cyclic codes overM2(ā¤4) (the matrix ring of matrices of order 2 over ā¤4), which is perhaps the first time that the ring is considered as a code alphabet.
Bhowmick Sanjit +3 more
doaj +1 more source
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-GuillƩn C. A. +1 more
doaj +1 more source
Polynomial realization of sequential codes over finite fields
In this paper we study the relation between polycyclic codes and sequential codes over finite fields. It is shown that, for a sequential code C ā F, C is realized as an ideal in the quotient ring of the polynomial ring.
M. Matsuoka
semanticscholar +1 more source
Monomial codes seen as invariant subspaces
It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known.
GarcĆa-Planas MarĆa Isabel +2 more
doaj +1 more source
Constacyclic codes over š½pm[u1, u2,āÆ,uk]/ć ui2 = ui, uiuj = ujuić
In this paper, we study linear codes over ring Rk = š½pm[u1, u2,āÆ,uk]/ćui2$\begin{array}{} u^{2}_{i} \end{array} $ = ui, uiuj = ujuić where k ā„ 1 and 1 ⤠i, j ⤠k.
Zheng Xiying, Kong Bo
doaj +1 more source

