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.     

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.     

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.     

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 .     

Notes on linear codes over finite commutative chain rings

The properties of the generator matrix are given for linear codes over finite commutative chain rings,and the so-called almost-MDS (AMDS) codes are studied.     

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.     

关于$\pi$-半交换环

A ring R is said to be π-semicommutative if a, b ∈ R satisfy ab = 0 then there exists a positive integer n such that anRbn= 0. We study the properties of π-semicommutative rings and the relationship between such rings and other related rings. In particular, we answer a question on left GWZI rings negatively.     

形式幂级数环上的自对偶码（英文）

The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr~l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r~(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we study self-dual codes over R_∞by means of self-dual codes over Ri,and give some characterizations of self-dual codes over R_∞.     

Theorems of Erdős-Ko-Rado type in geometrical settings

The original Erds-Ko-Rado problem has inspired much research. It started as a study on sets of pairwise intersecting k-subsets in an n-set, then it gave rise to research on sets of pairwise non-trivially intersecting k-dimensional vector spaces in the vector space V (n, q) of dimension n over the finite field of order q, and then research on sets of pairwise non-trivially intersecting generators and planes in finite classical polar spaces. We summarize the main results on the Erds-Ko-Rado problem in these three settings, mention the Erds-Ko-Rado problem in other related settings, and mention open problems for future research.     

Higher Level Orderings on Modules

The aim of this paper is to investigate higher level orderings on modules over commutative rings. On the basis of the theory of higher level orderings on fields and commutative rings, some results involving existence of higher level orderings are generalized to the category of modules over commutative rings. Moreover, a strict intersection theorem for higher level orderings on modules is established.     

Packing Superballs from Codes and Algebraic Curves

In the present paper, we make use of codes with good parameters and algebraic curves over finite fields with many rational points to construct dense packings of superballs. It turns out that our packing density is quite reasonable. In particular, we improve some values for the best-known lower bounds on packing density.     

关于多项式函数的计数

Polynomial functions （in particular, permutation polynomials） play an important role in the design of modern cryptosystem. In this note the problem of counting the number of polynomial functions over finite commutative rings is discussed. Let A be a general finite commutative local ring. Under a certain condition, the counting formula of the number of polynomial functions over A is obtained. Before this paper, some results over special finite commutative rings were obtained by many authors.     

Relative syzygies and grade of modules

Recently, Takahashi established a new approximation theory for finitely generated modules over commutative Noetherian rings, which unifies the spherical approximation theorem due to Auslander and Bridger and the Cohen-Macaulay approximation theorem due to Auslander and Buchweitz. In this paper we generalize these results to much more general case over non-commutative rings. As an application, we establish a relation between the injective dimension of a generalized tilting module ω and the finitistic dimension with respect to ω.     

利用有限域上一类幂零阵的标准形构造Cartesian认证码

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.     

非交换环的拟零因子图

In this paper, a new class of rings, called FIC rings, is introduced for studying quasi-zero-divisor graphs of rings. Let R be a ring. The quasi-zero-divisor graph of R, denoted by Γ_*(R), is a directed graph defined on its nonzero quasi-zero-divisors, where there is an arc from a vertex x to another vertex y if and only if x Ry = 0. We show that the following three conditions on an FIC ring R are equivalent:(1) χ(R) is finite;(2) ω(R) is finite;(3)Nil_*R is finite where Nil_*R equals the finite intersection of prime ideals. Furthermore, we also completely determine the connectedness, the diameter and the girth of Γ_*(R).     

CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m

In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.     

利用有限域上的向量空间构作带仲裁的认证码

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.     

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

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.