Negacyclic codes over Galois rings of characteristic 2 a

We investigate negacyclic codes over the Galois ring GR(2 a ,m) of length N = 2 k n,where n is odd and k 0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2 a ,m)[u]/ u 2 k + 1 .Then using a ring isomorphism we obtain the structure of negacyclic codes over GR(2 a ,m) of length N = 2 k n (n odd) and explore the existence of self-dual negacyclic codes over GR(2 a ,m).A bound for the homogeneous distance of such negacyclic codes is also given.     

On the Characterization of Cyclic Co des over Ring F2＋uF2＋v F2

In this work, we investigate the cyclic codes over the ring F2＋uF2＋vF2. We first study the relationship between linear codes over F2＋uF2＋vF2 and that over F2. Then we give a characterization of the cyclic codes over F2＋uF2＋vF2. Finally, we obtain the number of the cyclic code over F2＋uF2＋vF2 of length n.     

CYCLIC CODES OVER FORMAL POWER SERIES RINGS

In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.     

Cyclic Co des over F2＋uF2＋v F2

We study the structure of cyclic codes of an arbitrary length n over the ring F2＋uF2＋vF2, which is not a finite chain ring. We prove that the Gray image of a cyclic code length n over F2＋uF2＋vF2 is a 3-quasi-cyclic code length 3n over F2.     

有限域上的重根自对偶负循环码

Let F_q be a finite field with q = p~m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap~r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp~r over F_q is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.     

Linear recurring sequences and subfield subcodes of cyclic codes

Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurring sequences and subfield subcodes. Let Mqm(f(x)) denote the set of all linear recurring sequences over Fqm with characteristic polynomial f(x) over Fqm . Denote the restriction of Mqm(f(x)) to sequences over Fq and the set after applying trace function to each sequence in Mqm(f(x)) by Mqm(f(x)) | Fq and Tr( Mqm(f(x))), respectively. It is shown that these two sets are both complete sets of linear recurring sequences over Fq with some characteristic polynomials over Fq. In this paper, we firstly determine the characteristic polynomials for these two sets. Then, using these results, we determine the generator polynomials of subfield subcodes and trace codes of cyclic codes over Fqm .     

Binary cyclic codes with two primitive nonzeros

In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of Tr(x d ) over F2m in the case where m = 2t, d = 3 + 2t+1 and gcd(d, 2m-1) = 1.     

On Constacyclic Codes over Z_(p_1p_2…p_t)

Let t ≥ 2 be an integer, and let _(p_1, ···, p_t)be distinct primes. By using algebraic properties, the present paper gives a sufficient and necessary condition for the existence of non-trivial self-orthogonal cyclic codes over the ring Z_(p_1p_2···p_t)and the corresponding explicit enumerating formula. And it proves that there does not exist any self-dual cyclic code over Z_(p_1p_2···p_t).     

环$F_2 uF_2 u^2F_2$上的循环码及自对偶码

We give the structures of a cyclic code over ring
R = F2 ＋ uF2 ＋ u^2F2 = {0, 1,u, u^2,v, v^2,uv, v^3},
where u^3 = 0, of odd length and its dual code. For the cyclic code, necessary and sufficient conditions for the existence of self-dual code are provided.     

Quaternary quasi-cyclic codes

Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/（x^m - 1）. In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct sum of a fixed number of cyclic irreducible A-submodules. Finally the distinct quasi-cyclic codes as well as some specific subclasses are enumerated.     

A construction of maximal linearly independent array

Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.     

A class of generalized cyclic codes

1. IntroductionPrange was considered to be first person to study cyclic codes at the end of 1950s, seeIll and [2]. Since then, cyclic codes are the mostly studied of all codes, because they are easyto encode, and include an important family of BCH codes. A code C is cyclic if it is linearand if any cyclic shift of a codeword is also a codeword, i.e., whenever (co, of,' 1 on--l ) is inC then so is (c.--1, co j', c.--2). In fact, one could define a cyclic code to be an ideal in thering of…     

A Note on Ideals of a Three-Dimensional Associative Algebra

In this paper, we shall apply the theory of nilpotent radical to derive some results about ideals of a there-dimensional associative algebra over a field F and of an associative ring of order p~3 where p is a prime. These results are useful in studying the structure of the algebra and the ring.     

The abc-conjecture for Algebraic Numbers

The abe-conjecture for the ring of integers states that, for every ε 〉 0 and every triple of relatively prime nonzero integers （a, b, c） satisfying a ＋ b = c, we have max（｜a｜, ｜b｜, ｜c｜） 〈 rad（abc）^1＋ε with a finite number of exceptions. Here the radical rad（m） is the product of all distinct prime factors of m. In the present paper we propose an abe-conjecture for the field of all algebraic numbers. It is based on the definition of the radical （in Section 1） and of the height （in Section 2） of an algebraic number. From this abc-conjecture we deduce some versions of Fermat＇s last theorem for the field of all algebraic numbers, and we discuss from this point of view known results on solutions of Fermat＇s equation in fields of small degrees over Q.     

Cyclic Co des with Complementary Duals over Fp+v Fp

In this paper, we characterize the necessary and su?cient conditions for a cyclic code of length n over Fp+vFp to be an LCD code, where p is an odd prime.     

SELF-DUAL PERMUTATION CODES OVER FORMAL POWER SERIES RINGS AND FINITE PRINCIPAL IDEAL RINGS

In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.     

循环群$Z_{2}$的模向量不变式

Let G be the finite cyclic group Z_2 and V be a vector space of dimension 2n with basis x_1,...,x_n,y_1,...,y_n over the field F with characteristic 2.If σ denotes a generator of G,we may assume that σ（x_i）= ayi,σ（y_i）= a～-1x_i,where a ∈ F.In this paper,we describe the explicit generator of the ring of modular vector invariants of F[V]～G.We prove that F[V]～G = F[l_i = x_i ＋ ay_i,q_i = x_iy_i,1 ≤ i ≤ n,M_I = X_I ＋ a～-I-Y_I],where I∈An = {1,2,...,n},2 ≤-I-≤ n.     

Type Ⅱ codes over finite rings

In this paper,we generalize the concept of Type Ⅱ codes to arbitrary finite rings. We focus on Type Ⅱ codes over finite chain rings and use the Chinese Remainder Theorem on these codes to study Type Ⅱ codes over principal ideal rings.