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.     

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.     

New bounds for codes over finite Frobenius rings

We give further results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper (Greferath and O’Sullivan, Discr Math 289:11–24, 2004) and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.     

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.     

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.     

The linear programming bound for codes over finite Frobenius rings

In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings. An erratum to this article can be found at     

Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3

The main results of this paper are in two directions. First, the family of finite local Frobenius non-chain rings of length 4 (hence of nilpotency index 3) is determined. As a by-product all finite local Frobenius non-chain rings with $p^4$ elements, (p a prime) are given. Second, the number and structure of γ-constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3, of length relatively prime to the characteristic of the residue field of the ring, are determined.     

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.     

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.     

Linear equations over commutative rings

A generalized rank (McCoy rank) of a matrix with entries in a commutative ring R with identity is discussed. Some necessary and sufficient conditions for the solvability of the linear equation Ax = b are derived, where x, b are vectors and A is a matrix with entries in either a Noetherian full quotient ring or a zero dimensional ring.     

Quaternion algebras over commutative rings

Translated from Matematicheskie Zametki, Vol. 53, No. 2, pp. 126–131, February, 1993.     

Polynomial rings over Goldie-Kerr commutative rings II

An overlooked corollary to the main result of the stated paper (Proc. Amer. Math. Soc. 120 (1994), 989--993) is that any Goldie ring of Goldie dimension 1 has Artinian classical quotient ring , hence is a Kerr ring in the sense that the polynomial ring satisfies the on annihilators . More generally, we show that a Goldie ring has Artinian when every zero divisor of has essential annihilator (in this case is a local ring; see Theorem ). A corollary to the proof is Theorem 2: A commutative ring has Artinian iff is a Goldie ring in which each element of the Jacobson radical of has essential annihilator. Applying a theorem of Beck we show that any ring that has Noetherian local ring for each associated prime is a Kerr ring and has Kerr polynomial ring (Theorem 5).

     

Clean matrices over commutative rings

A matrix A ∈ M _n (R) is e-clean provided there exists an idempotent E ∈ M _n (R) such that A-E ∈ GL _n (R) and det E = e. We get a general criterion of e-cleanness for the matrix [[a ₁, a ₂,..., a _n +1]]. Under the n-stable range ondition, it is shown that [[a ₁, a ₂,..., a _n +1]] is 0-clean iff (a ₁, a ₂,..., a _n +1) = 1. As an application, we prove that the 0-cleanness and unit-regularity for such n × n matrix over a Dedekind domain coincide for all n ⩾ 3. The analogous for (s, 2) property is also obtained.      

Self-dual codes over the Kleinian four group

We introduce self-dual codes over the Kleinian four group K=Z ₂×Z ₂ for a natural quadratic form on K ⁿ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to length 8, neighbourhood graphs, extremal codes, shadows, generalized t-designs, lexicographic codes, the Hexacode and its odd and shorter cousin, automorphism groups, marked codes. Kleinian codes form a new and natural fourth step in a series of analogies between binary codes, lattices and vertex operator algebras. This analogy will be emphasized and explained in detail.     

Polynomial rings over commutative reduced Hopfian local rings

We prove that if R is a commutative, reduced, local ring, then R is Hopfian if and only if the ring R[x] is Hopfian. This answers a question of Varadarajan [16], in the case when R is a reduced local ring. We provide examples of non-Noetherian Hopfian commutative domains by proving that the finite dimensional domains are Hopfian. Also, we derive some general results related to Hopfian rings.     

Errata for “The linear programming bound for codes over finite Frobenius rings”

The authors discovered some mistakes in the article that appeared on pp. 289–301 of the March volume of DCC 42 (2007). The validity of its results is not affected, nor is that of the examples since their computation did not involve the dual version of the LP bound. In any case, we feel the errors need to be rectified here. The online version of the original article can be found under doi:.