环F_2+uF_2上偶长的(1+u)-常循环码

给出了环F2+uF2上任意偶长的(1+u)-常循环码的结构,确定了给定偶长度F2+uF2上(1+u)-常循环码的数目.通过Gray映射,得到了F2+uF2上偶长的(1+u)-常循环码的二元象.     

AMDS symbol-pair codes from repeated-root cyclic codes

Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. One of the central themes in symbol-pair coding theory is the constructions of symbol-pair codes with the largest possible minimum symbol-pair distance. Maximum distance separable (MDS) and almost maximum distance separable (AMDS) symbol-pair codes are optimal and sub-optimal regarding the Singleton bound, respectively. In this paper, six new classes of AMDS symbol-pair codes are explicitly constructed through repeated-root cyclic codes. Remarkably, one class of such codes has unbounded lengths and the minimum symbol-pair distance of another class can reach 13.     

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.     

环F2＋uF2上偶长的（1＋u）-常循环码

给出了环F2＋uF2上任意偶长的（1＋u）-常循环码的结构，确定了给定偶长度F2＋uF2上（1＋u）-常循环码的数目．通过Gray映射，得到了F2＋uF2上偶长的（1＋u）-常循环码的二元象．     

MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes

Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed to protect against the pair errors in symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable (MDS) symbol-pair codes that possess the largest possible pair-error correcting performance. Based on repeated-root cyclic codes, we construct two classes of MDS symbol-pair codes for more general generator polynomials and also give a new class of almost MDS (AMDS) symbol-pair codes with the length lp. In addition, we derive all MDS and AMDS symbol-pair codes with length 3p, when the degree of the generator polynomials is no more than 10. The main results are obtained by determining the solutions of certain equations over finite fields.     

Duals of constacyclic codes over finite local Frobenius non-chain rings of length 4

Duals of constacyclic codes over a finite local Frobenius non-chain ring of length 4, the length of which is relatively prime to the characteristic of the residue field of the ring are determined. Generators for the dual code are obtained from those of the original constacyclic code. In some cases self-dual codes are determined.     

环F2+uF2上长为2e的(1+u)-循环码

最近,环F2+uF2上的线性码引起了编码研究者极大的兴趣.本文证明了R[x]/〈xn+1+u〉是有限链环,其中R=F2+uF2=F2[u]/〈u2〉且n=2e.从而给出了F2+uF2上的所有长为2e的(1+u)-循环码,进而给出了所有(1+u)-循环码的对偶码.证明了F2+uF2上不存在长为2e的非平凡的自对偶的(1+u)-循环码.     

Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pair-distance five or six. Moreover, we find a necessary and sufficient condition which ensures a class of cyclic codes to be MDS symbol-pair codes. This condition is related to certain property of a special kind of linear fractional transformations. A detailed analysis on these linear fractional transformations leads to an algorithm, which produces many MDS symbol-pair codes with minimum pair-distance seven.     

环F3+vF3上的循环码与常循环码

本文研究了环F₃+vF₃上的循环码与常循环码.通过环F₃+vF₃与域F₃上的循环码之间关系,证明了环F₃+vF₃上循环码是由一个多项式生成的.最后,用类似的方法,得到了环F₃+vF₃上v-常循环码也是由一个多项式生成的.     

一类四元环上常循环码是自由码的充要条件

本文研究了环F2 uF2上的奇长度的循环码和(1 u)-循环码.运用代数方法,得到了F2 uF2上的循环码和(1 u)-循环码成为自由码的几个充要条件.推广了Bonnecaze(1999)和Aydin(2002)的关于自由码的结果.     

Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes

Using ideas from the cohomology of finite groups, an isomorphism is established between a group ring and the direct sum of twisted group rings. This gives a decomposition of a group ring code into twisted group ring codes. In the abelian case the twisted group ring codes are (multi-dimensional) constacyclic codes. We use the decomposition to prove that, with respect to the Euclidean inner product, there are no self-dual group ring codes when the group is the direct product of a 2-group and a group of odd order, and the ring is a field of odd characteristic or a certain modular ring. In particular, there are no self-dual abelian codes over the rings indicated. Extensions of these results to non-Euclidean inner products are briefly discussed.     

The Theory of Cyclic Codes and a Generalization to Additive Codes

We present a new approach to the theory of cyclic and constacyclic codes and generalize the theory to cover the family of additive (not necessarily linear) cyclic codes. The approach is based on the action of the Galois group (cyclotomic cosets). The conventional representation of cyclic codes as ideals in a factor ring of the polynomial ring is not needed.     

Codes of Small Defect

The parameters of a linear code C over GF(q) are given by [n,k,d], where n denotes the length, k the dimension and d the minimum distance of C. The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n-k+1 Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which d=n-k. We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev Dodunekov. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson 5 on the existence of self-dual [2d,d,d]-codes which have no code words of weight d+1. Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.     

环F_p+uF_p+vF_p+uvF_p上的循环码

讨论了非有限链环R=F_p+uF_p+vF_p+uvF_p上的循环码.通过环R上的循环码与多项式环R_n=(F_p+uF_p+vF_p+uvF_p)[x]/(xⁿ-1)的理想的对应关系及对R_n的研究给出了R上循环码的刻画.最后定义了一个Gray映射,并刻画了F_p+uF_p+vF_p+uvF_p上的循环码在该映射下的像.     

Galois环上本原序列压缩映射的单性

设Ω是 Ｇａｌｏｉｓ环 ＧＲ（２~ｄ,ｒ）的 Ｔｅｉｃｈｍｕｌｌｅｒ代表集,则 ＧＲ（２~ｄ,ｒ）上每条序列ａ有唯一的权位分解,　其中ａ-ｉ是Ω上序列,同时也可自然视为有限域Ｆ-（２~ｒ）,上序列．设ｆ（ｘ）是环 ＧＲ（２~ｄ,ｒ）上强本原多项式,Ｇ（ｆ（ｘ））表示 ＧＲ（２~ｄ,ｒ）上以ｆ（ｘ）为特征多项式的序列的全体,是Ｆ-（２~ｒ）上一类ｄ－１元多项式, 　本文证明了压缩映射是单射,即对 ａ＝ ｂ当且仅当对所有 ａ,ｂ ∈ Ｇ（ｆ（ｘ））．     

New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes

Previous results have shown that the class of quasi-cyclic (QC) codes contains many good codes. In this paper, new rate (m - 1)/pm QC codes over GF(3) and GF(4) are presented. These codes have been constructed using integer linear programming and a heuristic combinatorial optimization algorithm based on a greedy local search. Most of these codes attain the maximum possible minimum distance for any linear code with the same parameters, i.e., they are optimal, and 58 improve the maximum known distances. The generator polynomials for these 58 codes are tabulated, and the minimum distances of rate (m - 1)/pm QC codes are given.     

环F_2+uF_2上长为2~e循环码的Gray象

利用环F2+uF2上长为2e的循环码结构,证明了这样的循环码的一类码在Gray映射下的象是循环码,并给出了环F2+uF2上长为2e的循环码的Gray象仍是循环码的一个充要条件.     

环GR(4,2)上一类负循环码的Gray象

研究了GR(4,2)上长为2~s的负循环码的Gray象,证明了GR(4,2)上长为2~s的负循环码的Gray象是F_4上长为2~(s+2)指数为2的准循环码.通过计算GR(2~a,m)上长为2~s的负循环码的齐次距离,确定了GR(4,2)上长为2~s的负循环码的Gray象的汉明距离.     

Iso-orthogonality and Type-II duadic constacyclic codes

Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e., Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic constacyclic codes are isometrically orthogonal, and the duals of even-like duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit necessary and sufficient conditions for the existence of even-like duadic constacyclic codes. A class of even-like duadic constacyclic codes which are alternant MDS-codes is constructed.