Matrix product codes over finite commutative Frobenius rings

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.     

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.     

Homogeneous weights of matrix product codes over finite principal ideal rings

In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.     

Self-dual codes over commutative Frobenius rings

We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for finite commutative Frobenius rings, showing that all self-dual codes with minimum weight greater than 2 can be obtained in this manner in cases where the construction applies.     

Homogeneous metric and matrix product codes over finite commutative principal ideal rings

In this paper, a necessary and sufficient condition for the homogeneous distance on an arbitrary finite commutative principal ideal ring to be a metric is obtained. We completely characterize the lower bound of homogeneous distances of matrix product codes over any finite principal ideal ring where the homogeneous distance is a metric. Furthermore, the minimum homogeneous distances of the duals of such codes are also explicitly investigated.     

Constacyclic codes over finite commutative semi-simple rings

Finite commutative semi-simple rings are direct sum of finite fields. In this study, we investigate the algebraic structure of λ-constacyclic codes over such finite semi-simple rings. Among others, necessary and sufficient conditions for the existence of self-dual, LCD, and Hermitian dual-containing λ-constacyclic codes over finite semi-simple rings are provided. Using the CSS and Hermitian constructions, quantum MDS codes over finite semi-simple rings are constructed.     

Singleton Bounds for Codes over Finite Rings

We introduce the Singleton bounds for codes over a finite commutative quasi-Frobenius ring.     

Additive cyclic codes over finite commutative chain rings

Additive cyclic codes over Galois rings were investigated in Cao et al. (2015). In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in Cao et al. (2015), whereas the other one has some unusual properties especially while constructing dual codes. We interpret the reasons of such properties and illustrate our results giving concrete examples.     

Algebraic complexities and algebraic curves over finite fields

Algebraic schemes of computation of bilinear forms over various rings of scalars are examined. The problem of minimal complexity of these schemes is considered for computation of polynomial multiplication and multiplication in commutative algebras, and finite extensions of fields. While for infinite fields minimal complexities are known (Winograd, Fiduccia, Strassen), for finite fields precise minimal complexities are not yet determined. We prove lower and upper bounds on minimal complexities. Both are linear in the number of inputs. These results are obtained using the relationship with linear coding theory and the theory of algebraic curves over finite fields.     

2n Bordered constructions of self-dual codes from group rings

Self-dual codes, which are codes that are equal to their orthogonal, are a widely studied family of codes. Various techniques involving circulant matrices and matrices from group rings have been used to construct such codes. Moreover, families of rings have been used, together with a Gray map, to construct binary self-dual codes. In this paper, we introduce a new bordered construction over group rings for self-dual codes by combining many of the previously used techniques. The purpose of this is to construct self-dual codes that were missed using classical construction techniques by constructing self-dual codes with different automorphism groups. We apply the technique to codes over finite commutative Frobenius rings of characteristic 2 and several group rings and use these to construct interesting binary self-dual codes. In particular, we construct some extremal self-dual codes of length 64 and 68, constructing 30 new extremal self-dual codes of length 68.     

Linear Codes over \mathbb{F}_{q}[u]/(u^s) with Respect to the Rosenbloom–Tsfasman Metric

We investigate the structure of codes over rings with respect to the Rosenbloom-Tsfasman (RT) metric. We define a standard form generator matrix and show how we can determine the minimum distance of a code by taking advantage of its standard form. We define MDR (maximum distance rank) codes with respect to this metric and give the weights of the codewords of an MDR code. We explore the structure of cyclic codes over and show that all cyclic codes over rings are MDR. We propose a decoding algorithm for linear codes over these rings with respect to the RT metric. AMS Classification: 94B05, 94B60     

Minimal degree liftings in characteristic 2

In this paper we analyze liftings of hyperelliptic curves over perfect fields in characteristic 2 to curves over rings of Witt vectors. This theory can be applied to construct error-correcting codes; lifts of points with minimal degrees are likely to yield the best codes, and these are the main focus of the paper. We find upper and lower bounds for their degrees, give conditions to achieve the lower bounds and analyze the existence of lifts of the Frobenius. Finally, we exhibit explicit computations for genus 2 and show codes obtained using this theory.     

Class and rank of differential modules

A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class – a substitute for the length of a free complex – and on the rank of a differential module in terms of invariants of its homology. These results specialize to basic theorems in commutative algebra and algebraic topology. One instance is a common generalization of the equicharacteristic case of the New Intersection Theorem of Hochster, Peskine, P. Roberts, and Szpiro, concerning complexes over commutative noetherian rings, and of a theorem of G. Carlsson on differential graded modules over graded polynomial rings.     

Determinants of matrices over commutative finite principal ideal rings

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring R of a fixed determinant a is determined for all $a\in R$ and positive integers n. Using the fact that every commutative finite principal ideal ring is a product of commutative finite chain rings, the number of $n\times n$ matrices of a fixed determinant over a commutative finite principal ideal ring is shown to be multiplicative, and hence, it can be determined. These results generalize the case of matrices over the ring of integers modulo m.     

Soluble linear groups over Euclidean rings

We study soluble matrix groups over commutative rings and transfer some results of the theory of soluble matrix groups over a field to the case of soluble matrix groups over commutative rings.     

Quasi-cyclic codes as cyclic codes over a family of local rings

We give an algebraic structure for a large family of binary quasi-cyclic codes. We construct a family of commutative rings and a canonical Gray map such that cyclic codes over this family of rings produce quasi-cyclic codes of arbitrary index in the Hamming space via the Gray map. We use the Gray map to produce optimal linear codes that are quasi-cyclic.     

关于多项式函数的计数

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.     

$$\mathbb {Z}_{4}$$-codes and their Gray map images as orthogonal arrays

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over \(\mathbb {Z}_{4}\) and their (usually non-linear) binary Gray map images. We show that Delsarte’s observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a \(\mathbb {Z}_{4}\) code is one less than the minimum Lee weight of its Gray map image.