Linear codes using skew polynomials with automorphisms and derivations

In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gabidulin codes, we introduce new notions of evaluation of skew polynomials with derivations and the corresponding evaluation codes. We propose several approaches to generalize Reed-Solomon and BCH codes to module skew codes and for two classes we show that the dual of such a Reed-Solomon type skew code is an evaluation skew code. We generalize a decoding algorithm due to Gabidulin for the rank metric and derive families of Maximum Distance Separable and Maximum Rank Distance codes.     

关于环$Z_4[u]/\langle u2-2\rangle$上的斜多元循环码

本文探索了环$R=Z_4[u]/\langle u2-2\rangle$ 上的几类斜多元循环码和多元循环码. 首先得到了环$R$上$(1,2u)$-多元循环码的生成多项式. 其次由定义的Gray映射得到了环$R$上$(1,2u)$- 多元循环码的Gray像是$Z_4$上的循环码或指数为2的逆循环码. 最后, 通过环$R$上$(1,2u)$- 多元循环码的一些例子来展示本文的主要结果.     

Skew quasi-cyclic codes over Galois rings

Recently there has been a lot of interest on algebraic codes in the setting of skew polynomial rings. In this paper we have studied skew quasi-cyclic (QC) codes over Galois rings. We have given a necessary and sufficient condition for skew cyclic codes over Galois rings to be free, and determined a distance bound for free skew cyclic codes. A sufficient condition for 1-generator skew QC codes to be free is determined. Some distance bounds for free 1-generator skew QC codes are discussed. A canonical decomposition of skew QC codes is presented.     

Roos bound for skew cyclic codes in Hamming and rank metric

In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The proofs involve arithmetic properties of skew polynomials and an analysis of the rank of parity-check matrices. For the rank metric case, a way to arithmetically construct codes with a prescribed minimum rank distance, using the skew Roos bound, is also given. Moreover, some examples of MDS codes and MRD codes over finite fields are built, using the skew Roos bound.     

Hartmann–Tzeng bound and skew cyclic codes of designed Hamming distance

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann–Tzeng bound that works for a wide class of skew cyclic codes. We also provide a practical method for constructing them with designed distance. For skew BCH codes, which are covered by our constructions, we discuss decoding algorithms. Detailed examples illustrate both the theory as the constructive methods it supports.     

Peterson–Gorenstein–Zierler algorithm for skew RS codes

We design a non-commutative version of the Peterson–Gorenstein–Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure. Since we work over an arbitrary field, our techniques may be applied both to linear block codes and convolutional codes. In particular, our decoding algorithm applies for block codes beyond the classical cyclic case.     

Skew codes of prescribed distance or rank

In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40, 23, 10]₄ code by imposing a distance and a [42,14,21]₈ code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal length and dimension over those fields. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section.      

Skew-cyclic codes over $$B_k$$

In this paper we study the structure of \(\theta \)-cyclic codes over the ring \(B_k\) including its connection to quasi-\({\tilde{\theta }}\)-cyclic codes over finite field \({\mathbb {F}}_{p^r}\) and skew polynomial rings over \(B_k\). We also characterize Euclidean self-dual \(\theta \)-cyclic codes over the rings. Finally, we give the generator polynomial for such codes and some examples of optimal Euclidean \(\theta \)-cyclic codes.     

Skew Hadamard designs and their codes

Skew Hadamard designs (4n – 1, 2n – 1, n – 1) are associated to order 4n skew Hadamard matrices in the natural way. We study the codes spanned by their incidence matrices A and by I + A and show that they are self-dual after extension (resp. extension and augmentation) over fields of characteristic dividing n. Quadratic Residues codes are obtained in the case of the Paley matrix. Results on the p-rank of skew Hadamard designs are rederived in that way. Codes from skew Hadamard designs are classified. An optimal self-dual code over GF(5) is rediscovered in length 20. Six new inequivalent [56, 28, 16] self-dual codes over GF(7) are obtained from skew Hadamard matrices of order 56, improving the only known quadratic double circulant code of length 56 over GF(7).     

On Skew E–W Matrices

An E–W matrix M is a ( ? 1, 1)‐matrix of order , where t is a positive integer, satisfying that the absolute value of its determinant attains Ehlich–Wojtas' bound. M is said to be of skew type (or simply skew) if is skew‐symmetric where I is the identity matrix. In this paper, we draw a parallel between skew E–W matrices and skew Hadamard matrices concerning a question about the maximal determinant. As a consequence, a problem posted on Cameron's website [7] has been partially solved. Finally, codes constructed from skew E–W matrices are presented. A necessary and sufficient condition for these codes to be self‐dual is given, and examples are provided for lengths up to 52.     

Cyclic subspace codes via subspace polynomials

Subspace codes have been intensely studied in the last decade due to their application in random network coding. In particular, cyclic subspace codes are very useful subspace codes with their efficient encoding and decoding algorithms. In a recent paper, Ben-Sasson et al. gave a systematic construction of subspace codes using subspace polynomials. In this paper, we mainly generalize and improve their result so that we can obtain larger codes for fixed parameters and also we can increase the density of some possible parameters. In addition, we give some relative remarks and explicit examples.     

On a System of Martix Equations over an Arbitrary Skew Field

ＯｎａＳｙｓｔｅｍｏｆＭａｒｔｉｘＥｑｕａｔｉｏｎｓｏｖｅｒａｎＡｒｂｉｔｒａｒｙＳｋｅｗＦｉｅｌｄ￥ＷａｎｇＱｉｎｇｗｅｎ（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＣｈａｎｇｗｅｉＴｅａｃｈｅｒｓＣｏｌｌｅｙｅ，Ｗｅｉｆａｎｇ，Ｗｅｉｆａｎｇ，２６１０４３）Ａｂ...     

Partial actions and partial skew group rings

In this paper we consider partial actions of groups on algebras and partial skew group rings. After some general results we prove two versions of Maschke's theorem and then we study von Neumann regularity, the prime radical and the Jacobson radical of partial skew group rings. In this way we extend many results which are known for skew group rings.     

不含偶圈双圈图的极小斜能量

令G为简单连通图. 给图G的每条边赋予一个方向, 得到的有向图, 记为G^\sigma. 有向图G^\sigma的斜能量E_{s}(G^{\sigma})定义为G^\sigma的斜邻接矩阵特征值的绝对值之和. 令\mathcal{B}^\circ_{n}表示顶点个数为n不含偶圈的双圈图的集合. 考虑了\mathcal{B}^\circ_{n}中图依斜能量从小到大的排序问题. 利用有向图斜能量的积分公式和实分析的方法, 当n \geq 156和155 \geq n\geq 12时, 分别得到了\mathcal{B}^\circ_{n}中具有最小、次二小和次三小斜能量的双圈图.     

Non-invertible-element constacyclic codes over finite PIRs

In this paper we introduce the notion of λ-constacyclic codes over finite rings R for arbitrary element λ of R. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal rings (PIRs). We determine the algebraic structures of all NIE-constacyclic codes over finite chain rings, give the unique form of the sets of the defining polynomials and obtain their minimum Hamming distances. A general form of the duals of NIE-constacyclic codes over finite chain rings is also provided. In particular, we give a necessary and sufficient condition for the dual of an NIE-constacyclic code to be an NIE-constacyclic code. Using the Chinese Remainder Theorem, we study the NIE-constacyclic codes over finite PIRs. Furthermore, we construct some optimal NIE-constacyclic codes over finite PIRs in the sense that they achieve the maximum possible minimum Hamming distances for some given lengths and cardinalities.     

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.     

Bipartite graphs without a skew star

A skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 from the only vertex of degree three. In the present paper, we propose a structural characterization for the class of bipartite graphs containing no skew star as an induced subgraph and discuss some applications of the obtained result.     

Three-divisible families of skew lines on a smooth projective quintic

We give an example of a family of 15 skew lines on a quintic such that its class is divisible by 3. We study properties of the codes given by arrangements of disjoint lines on quintics.