关于前缀码与极大前缀码的一个注记

设X为有限非空集合,X~ 为X生成的自由半群.X~ 中的元素称为X上的字,用1表示空字.X=X~ ∪{1}为X生成的自由幺半群(freemonoid),X的子集称为X上的语言. X上的语言A真称为X上的前缀码;如果A∩AX~ =φ.X上的前缀码A称为X上的极大前缀码,如果对任何x∈X-A,A∪{x}不是前缀码.记X上的前缀码的类为P(X),X上的极大前缀码的类为M(X).     

p-进制码的自对偶码

本文研究了p-进制环Zp∞={∞∑l=0 alpl|0≤al≤p-1}上线性码的自对偶码的问题.利用p-进制环Zp∞上码C在有限链环Zpα的投影码的自正交性与对偶性,得到了p-进制环上码C的自正交性与对偶性的两个结果.     

环Fq+uFq+vFq上的循环码和量子码

本文研究了环R=F_q+uF_q+vF_q(u²=u,v²=v,uv=vu=0)上的循环码构造量子码的方法.利用环R上循环码的分解与生成多项式,给出了R上一个循环码可以构造量子码的一个充要条件.作为这类循环码的应用,得到了新的非二元量子码.     

环F4[v]/(v2+v)上DNA码

文章研究了环R=F_4[v]/(v~2+v)上的DNA码.基于环R上长度为n的线性码的代数结构,给出了环R上长度为n的线性码是可逆的DNA码的一个充要条件.同时,给出了环R上长度为n的线性码是可逆补DNA码的一个充要条件.     

环F_2+uF_2+…+u~kF_2上的Type Ⅱ码

给出一种构造环F2+uF2+…+ukF2上任意偶数长度的自正交和自对偶码的方法.定义了环F2+uF2+…+ukF2的每个元素的Euclidean重量并且证明了环F2+uF2+…+ukF2上的自对偶码是Euclidean重量为2k+2倍数的TypeⅡ码.     

环F_p+uF_p+vF_p+uvF_p上线性码的Gray像

定义了有限非链环R=F_p+uF_p+vF_p+uvF_p到F_p⁴的一个Gray映射.在证明了该映射是R4的一个Gray映射.在证明了该映射是Rⁿ到F_pn到F_p⁽⁴ⁿ⁾的等重等距映射的基础上进一步证明了环R上的线性码C的Gray像是距离不变码.特别地如果C是环F_2+uF_2+vF_2+uvF_2上的Lee恒距线性码,则Φ(C)为F_2上的Hamming恒距线性码.最后通过映射Ψ把F_p+uF_p上的线性码和R上的一类线性码对应起来.     

有限偶链环上类型Ⅱ码

从任意有限环上类型Ⅱ码的概念出发,借助两类有限链环为偶环的特性,研究了其上码为类型Ⅱ码的条件,得到了两个结果.     

环R=F_4+vF_4上线性码的Macwilliams恒等式

本文研究了环R=F4+v F4上线性码及重量分布.利用环R=F4+v F4到F2的一种Gray映射?,证明了环上R线性码C的Gray像?(C)的对偶码为?(C⊥).然后,利用域F2上线性码与对偶码的重量分布的关系及Gray映射性质,给出了该环上线性码与对偶码之间的各种重量分布的Macwilliams恒等式.     

k-前缀码与k-内缀码

本文引入了X~*上k-前缀、k-后缀、k-内缀、k-外缀关系及这些关系所对应的无关集的概念。得到了四个不同的单调递减的么半群链,每一个链均以X上的超码类作为其链的最大下界。我们还讨论了k-前缀,k-后缀码,k-内缀码的一些性质及前缀码和内缀码的格性质。     

模糊化内缀码和模糊化外缀码

在自由幺半群上引进模糊化内缀码和模糊化外缀码的概念,并进一步讨论它们的基本代数性质。     

A generalization of quasi-twisted codes: Multi-twisted codes

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. This suggests that considering this larger class in computer searches is promising for constructing codes with better parameters than currently best-known linear codes. Working with this new class of codes motivated us to consider a problem about binomials over finite fields and to discover a result that is interesting in its own right.     

A q-polynomial approach to constacyclic codes

As a generalization of cyclic codes, constacyclic codes is an important and interesting class of codes due to their nice algebraic structures and various applications in engineering. This paper is devoted to the study of the q-polynomial approach to constacyclic codes. Fundamental theory of this approach will be developed, and will be employed to construct some families of optimal and almost optimal codes in this paper.     

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.     

Cyclically permutable representations of cyclic codes

Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple-access (CDMA) radio systems and optical CDMA. The usual emphasis is on finding constant weight cyclically permutable codes with the maximum number of codewords. In this paper the question of when a particular error-correcting code is equivalent (by permutation of the symbols) to a cyclically permutable code is addressed. The problem is introduced for simplex codes and a motivating example is given. In the final section it is shown that the construction technique may be applied in general to cyclic codes.     

An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem

Regarding quasi-cyclic codes as certain polynomial matrices, we show that all reversible quasi-cyclic codes are decomposed into reversible linear codes of shorter lengths corresponding to the coprime divisors of the polynomials with the form of one minus x to the power of m. This decomposition brings us an efficient method to construct reversible quasi-cyclic codes. We also investigate the reversibility and the self-duality of the linear codes corresponding to the coprime divisors of the polynomials. Specializing to the cases where the number of cyclic sections is not more than two, we give necessary and sufficient conditions for the divisors of the polynomials for which the self-dual codes are reversible and the reversible codes of half-length-dimension are self-dual. Our theorems are utilized to search reversible self-dual quasi-cyclic codes with two cyclic sections over binary and quaternary fields of lengths up to seventy and thirty-six, respectively, together with the maximums of their minimum weights.     

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.     

An explicit class of codes with good parameters and their duals

We study a class of codes with good parameters and their duals explicitly. We give direct constructions of the dual codes and obtain self-orthogonal codes with good parameters.     

Galois hulls of special Goppa codes and related codes with application to EAQECCs

Galois hulls of MDS codes can be applied to construst MDS entanglement-assisted quantum error-correcting codes (EAQECCs). Goppa codes and expurgated Goppa codes (resp., extended Goppa codes) over ${\mathbb{F}}_{q^m}$ are GRS codes (resp., extended GRS codes) when $m=1$. In this paper, we investigate the Galois dual codes of a special kind of Goppa codes and related codes and provide a necessary and sufficient condition for the Galois dual codes of such codes to be Goppa codes and related codes. Then we determine the Galois hulls of the above codes. In particular, we completely characterize Galois LCD, Galois self-orthogonal, Galois dual-containing and Galois self-dual codes among such family of codes. Moreover, we apply the above results to EAQECCs.