15 research outputs found
Negacyclic codes over Z4+uZ4
In this paper, we study negacyclic codes of odd length and of length
over the ring , . We give the complete
structure of negacyclic codes for both the cases. We have obtained a minimal
spanning set for negacyclic codes of odd lengths over . A necessary and
sufficient condition for negacyclic codes of odd lengths to be free is
presented. We have determined the cardinality of negacyclic codes in each case.
We have obtained the structure of the duals of negacyclic codes of length
over and also characterized self-dual negacyclic codes of length over
.Comment: 18 page
A class of cyclic Codes Over the Ring and its Gray image
Cyclic codes over R have been introduced recently. In this paper, we study
the cyclic codes over R and their image. Making use of algebraic
structure, we find the some good codes of length 28.Comment: 10 page
An explicit representation and enumeration for negacyclic codes of length over
In this paper, an explicit representation and enumeration for negacyclic
codes of length over the local non-principal ideal ring
is provided, where are any
positive integers and is odd. As a corollary, all distinct negacyclic codes
of length over are listed precisely. Moreover, a mass formula for the
number of negacyclic codes of length over is given and a mistake in
[Cryptogr. Commun. (2017) 9: 241--272] is corrected
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
-constacyclic codes over
Let where denotes the ring of
integers modulo and . In the present paper, we introduce a new Gray
map from to We study -constacyclic codes
over of odd lengths with the help of cyclic codes over . It is proved
that the Gray image of -constacyclic codes of length over are
cyclic codes of length over . Further, a number of linear
codes over as the images of -constacyclic codes over
are obtained
Negacyclic codes over the local ring of oddly even length and their Gray images
Let () and be an odd
positive integer. Then is a local non-principal ideal ring of elements
and there is a -linear Gray map from onto
which preserves Lee distance and orthogonality. First, a
canonical form decomposition and the structure for any negacyclic code over
of length are presented. From this decomposition, a complete
classification of all these codes is obtained. Then the cardinality and the
dual code for each of these codes are given, and self-dual negacyclic codes
over of length are presented. Moreover, all negacyclic codes over of length and all
self-dual codes among them are
presented precisely, where is a Mersenne prime. Finally, new
and good self-dual -quasi-twisted linear codes over with
basic parameters and of type and basic
parameters and of type which are Gray
images of self-dual negacyclic codes over of length are listed.Comment: arXiv admin note: text overlap with arXiv:1710.0923
Linear Codes over Z_4+uZ_4: MacWilliams identities, projections, and formally self-dual codes
Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of
Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams
identities for the complete, symmetrized and Lee weight enumerators are proved.
Two projections from Z_4+uZ_4 to the rings Z_4 and F_2+uF_2 are considered and
self-dual codes over Z_4+uZ_4 are studied in connection with these projections.
Finally three constructions are given for formally self-dual codes over
Z_4+uZ_4 and their Z_4-images together with some good examples of formally
self-dual Z_4-codes obtained through these constructions.Comment: 12 pages. Partially presented in the 13th International Workshop on
Algebraic and combinatorial coding theory, Pomorie, Bulgaria, 201
Self-dual cyclic codes over
In this paper, we study the codes over the matrix ring over ,
which is perhaps the first time the ring structure is
considered as a code alphabet. This ring is isomorphic to
, where is a root of the irreducible
polynomial and . We
first discuss the structure of the ring and then focus on
algebraic structure of cyclic codes and self-dual cyclic codes over
. We obtain the generators of the cyclic codes and their
dual codes. Few examples are given at the end of the paper.Comment: 10 page
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
On a class of constacyclic codes over the non-principal ideal ring
-constacyclic codes of arbitrary length over the non-principal ideal
ring are studied, where is a prime,
and an integer satisfying .
First, the structure of any -constacyclic code over are presented. Then enumerations for the number of all
codes and the number of codewords in each code, and the structure of dual codes
for these codes are given, respectively. Then self-dual -constacyclic
codes over are investigated, where
or if , and if