17 research outputs found
The homogeneous weight for , related Gray map and new binary quasicyclic codes
Using theoretical results about the homogeneous weights for Frobenius rings,
we describe the homogeneous weight for the ring family , a recently
introduced family of Frobenius rings which have been used extensively in coding
theory. We find an associated Gray map for the homogeneous weight using first
order Reed-Muller codes and we describe some of the general properties of the
images of codes over under this Gray map. We then discuss quasitwisted
codes over and their binary images under the homogeneous Gray map. In
this way, we find many optimal binary codes which are self-orthogonal and
quasicyclic. In particular, we find a substantial number of optimal binary
codes that are quasicyclic of index 8, 16 and 24, nearly all of which are new
additions to the database of quasicyclic codes kept by Chen.Comment: Submitted to be publishe
Cyclic DNA codes over F2+uF2+vF2+uvF2
In this work, we study the structure of cyclic DNA codes of arbitrary lengths
over the ring R=F2+uF2+vF2+uvF2 and establish relations to codes over R1=F2+uF2
by defining a Gray map between R and R1^2 where R1 is the ring with 4 elements.
Cyclic codes of arbitrary lengths over R satisfied the reverse constraint and
the reverse-complement constraint are studied in this paper. The GC content
constraint is considered in the last
DNA Cyclic Codes Over The Ring \F_2[u,v]/\langle u^2-1,v^3-v,uv-vu \rangle
In this paper, we mainly study the some structure of cyclic DNA codes of odd
length over the ring R = \F_2[u,v]/\langle u^2-1,v^3-v,uv-vu \rangle which
play an important role in DNA computing. We established a direct link between
the element of ring and 64 codons by introducing a Gray map from to
where is the ring of four elements. The
reverse constrain and the reverse-complement constraint codes over and
are studied in this paper. Binary image of the cyclic codes over R also
study. The paper concludes with some example on DNA codes obtained via gray
map.Comment: 17 pages, 4 Tables(Table 1 contained 2 pages). arXiv admin note:
substantial text overlap with arXiv:1508.02015; text overlap with
arXiv:1508.07113, arXiv:1505.06263 by other author
A family of constacyclic codes over and its application to quantum codes
We introduce a Gray map from to
and study -constacyclic codes over
where It is proved that
the image of a -constacyclic code length over
under the Gray map is a
distance-invariant quasi-cyclic code of index and length over
We also prove that every code of length which is the
Gray image of cyclic codes over of
length is permutation equivalent to a binary quasi-cyclic code of index
Furthermore, a family of quantum error-correcting codes obtained from the
Calderbank-Shor-Steane (CSS) construction applied to -constacyclic codes
over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}.
Reversible Codes and Its Application to Reversible DNA Codes over
Coterm polynomials are introduced by Oztas et al. [a novel approach for
constructing reversible codes and applications to DNA codes over the ring
, Finite Fields and Their Applications 46 (2017).pp.
217-234.], which generate reversible codes. In this paper, we generalize the
coterm polynomials and construct some reversible codes which are optimal codes
by using -quasi-reciprocal polynomials. Moreover, we give a map from DNA
-bases to the elements of , and construct reversible DNA codes over
by DNA--quasi-reciprocal polynomials
Some results of linear codes over the ring
In this paper, we mainly study the theory of linear codes over the ring . By the Chinese
Remainder Theorem, we have is isomorphic to the direct sum of four rings
. We define a Gray map from to
, which is a distance preserving map. The Gray image of a
cyclic code over is a linear code over . Furthermore, we
study the MacWilliams identities of linear codes over and give the the
generator polynomials of cyclic codes over . Finally, we discuss some
properties of MDS codes over
On Quantum Codes Obtained From Cyclic Codes Over
Let be a non-chain finite
commutative ring, where . In this paper, we mainly study the
construction of quantum codes from cyclic codes over . We obtained
self-orthogonal codes over as gray images of linear and cyclic
codes over . The parameters of quantum codes which are obtained from cyclic
code over are discussed.Comment: 9 pages. arXiv admin note: text overlap with arXiv:1407.1232 by other
author
-constacyclic codes over
Let be a finite field and be an indeterminate. This
article studies -constacyclic codes over the ring
where . We illustrate the generator polynomials and investigate the
structural properties of these codes via decomposition theorem
Polyadic cyclic codes over a non-chain ring
Let and be any two polynomials of degree and
respectively ( and are not both ), which split into distinct
linear factors over . Let
be a finite
commutative non-chain ring. In this paper, we study polyadic codes and their
extensions over the ring . We give examples of some polyadic codes
which are optimal with respect to Griesmer type bound for rings. A Gray map is
defined from which preserves
duality. The Gray images of polyadic codes and their extensions over the ring
lead to construction of self-dual, isodual, self-orthogonal and
complementary dual (LCD) codes over . Some examples are also
given to illustrate this
Cyclic codes over
In this paper, we have studied cyclic codes over the ring
, . We have considered cyclic codes of odd
lengths. A sufficient condition for a cyclic code over to be a
-free module is presented. We have provided the general form of
the generators of a cyclic code over and determined a formula for the ranks
of such codes. In this paper we have mainly focused on principally generated
cyclic codes of odd length over . We have determined a necessary condition
and a sufficient condition for cyclic codes of odd lengths over to be
-free.Comment: arXiv admin note: text overlap with arXiv:1412.375