In this paper, the determinants of n × n matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of n × n matrices over a commutative finite chain ring R of a fixed determinant a is determined for all a ∈ 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 × 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.

The main focus of this paper is the complete enumeration of self-dual abelian codes in non-principal ideal group algebras F 2 k [A × Z 2 × Z 2 s ] with respect to both the Euclidean and Hermitian inner products, where k and s are positive integers and A is an abelian group of odd order. Based on the well-known characterization of Euclidean and Hermitian self-dual abelian codes, we show that such enumeration can be obtained in terms of a suitable product of the number of cyclic codes, the number of Euclidean self-dual cyclic codes, and the number of Hermitian self-dual cyclic codes of length 2 s over some Galois extensions of the ring F 2 k + uF 2 k , where u 2 = 0. Subsequently, general results on the characterization and enumeration of cyclic codes and self-dual codes of length p s over F p k + uF p k are given. Combining these results, the complete enumeration of self-dual abelian codes in F 2 k [A × Z 2 × Z 2 s ] is therefore obtained.

No abstract

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual linear codes over the ring Fq + uFq + u 2 Fq with u 3 = 0 have been established. In this paper, Hermitian self-dual linear codes over Fq + uFq + u 2 Fq are studied for all square prime powers q. Complete characterization and enumeration of such codes are given. Subsequently, algebraic characterization of H-quasi-abelian codes in Fq[G] is studied, where H ≤ G are finite abelian groups and Fq[H] is a principal ideal group algebra. General characterization and enumeration of H-quasi-abelian codes and self-dual H-quasi-abelian codes in Fq[G] are given. For the special case where the field characteristic is 3, an explicit formula for the number of self-dual A × Z3-quasi-abelian codes in F3m [A × Z3 × B] is determined for all finite abelian groups A and B such that 3 |A| as well as their construction. Precisely, such codes can be represented in terms of linear codes and self-dual linear codes over F3m + uF3m + u 2 F3m . Some illustrative examples are provided as well.

No abstract