14,480 research outputs found

    Self-Dual and Complementary Dual Abelian Codes over Galois Rings

    Get PDF
    Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes over Galois rings are studied in terms of the ideals in the group ring GR(pr,s)[G]{\rm GR}(p^r,s)[G], where GG is a finite abelian group and GR(pr,s){\rm GR}(p^r,s) is a Galois ring. Characterizations of self-dual abelian codes have been given together with necessary and sufficient conditions for the existence of a self-dual abelian code in GR(pr,s)[G]{\rm GR}(p^r,s)[G]. A general formula for the number of such self-dual codes is established. In the case where gcd(G,p)=1\gcd(|G|,p)=1, the number of self-dual abelian codes in GR(pr,s)[G]{\rm GR}(p^r,s)[G] is completely and explicitly determined. Applying known results on cyclic codes of length pap^a over GR(p2,s){\rm GR}(p^2,s), an explicit formula for the number of self-dual abelian codes in GR(p2,s)[G]{\rm GR}(p^2,s)[G] are given, where the Sylow pp-subgroup of GG is cyclic. Subsequently, the characterization and enumeration of complementary dual abelian codes in GR(pr,s)[G]{\rm GR}(p^r,s)[G] are established. The analogous results for self-dual and complementary dual cyclic codes over Galois rings are therefore obtained as corollaries.Comment: 22 page

    Classification of generalized Hadamard matrices H(6,3) and quaternary Hermitian self-dual codes of length 18

    Get PDF
    All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of order 3 acting semi-regularly on points and blocks, and secondly, as collections of full weight vectors in quaternary Hermitian self-dual codes of length 18. The second enumeration is based on the classification of Hermitian self-dual [18,9] codes over GF(4), completed in this paper. It is shown that up to monomial equivalence, there are 85 generalized Hadamard matrices H(6,3), and 245 inequivalent Hermitian self-dual codes of length 18 over GF(4).Comment: 17 pages. Minor revisio

    Hermitian self-dual quasi-abelian codes

    Get PDF
    Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeration of Hermitian self-dual quasi-abelian codes are given. In the case of 1-generator quasi-abelian codes, we offer necessary and sufficient conditions for such codes to be Hermitian self-dual and give a formula for the number of these codes. In the case where the underlying groups are some pp-groups, the actual number of resulting Hermitian self-dual quasi-abelian codes are determined
    corecore