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.     

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.     

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.     

The dual of a constacyclic code,self dual,reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3

Over finite local Frobenius non-chain rings with nilpotency index 3 and when the length of the codes is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of $\gamma$-constacyclic codes is established and the algebraic characterization of self-dual $\gamma$-constacyclic codes, reversible $\gamma$-constacyclic codes and $\gamma$-constacyclic codes with complementary dual are given. Generators for the dual code are obtained from those of the original constacyclic code.     

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 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 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.     

On LCD,self dual and isodual cyclic codes over finite chain rings

In this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free LCD cyclic code does not exist over finite chain rings. Based on algebraic number theory, we introduce necessary and sufficient conditions for which all free cyclic codes over a finite chain ring are LCD. We have also obtained conditions on the existence of non trivial self dual cyclic codes of any length when the nilpotency index of the maximal ideal of a finite chain ring is even. Further, several constructions of isodual codes are given based on the factorization of the polynomial $x^n-1$ over a finite chain ring.     

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.