11 research outputs found

    Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over F4

    Get PDF
    Producción CientíficaIn this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field F4Ministerio de Economía, Industria y Competitividad (MTM2013-45588-C3-1-P / MTM2015-65764-C3-1-P / MTM2015-69138-REDT)Principado de Asturias (GRUPIN14-142

    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

    Self-dual codes over F_q+uF_q+u^2 F_q and applications

    Get PDF
    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+u2Fq\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q} with u3=0u^3=0 have been established. In this paper, Hermitian self-dual linear codes over Fq+uFq+u2Fq\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q} are studied for all square prime powers~qq. Complete characterization and enumeration of such codes are given. Subsequently, algebraic characterization of HH-quasi-abelian codes in Fq[G]\mathbb{F}_q[G] is studied, where HGH\leq G are finite abelian groups and Fq[H]\mathbb{F}_q[H] is a principal ideal group algebra. General characterization and enumeration of HH-quasi-abelian codes and self-dual HH-quasi-abelian codes in Fq[G]\mathbb{F}_q[G] are given. For the special case where the field characteristic is 33, an explicit formula for the number of self-dual A×Z3A\times \mathbb{Z}_3-quasi-abelian codes in F3m[A×Z3×B]\mathbb{F}_{3^m}[A\times \mathbb{Z}_3\times B] is determined for all finite abelian groups AA and BB such that 3A3\nmid |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+u2F3m\mathbb{F}_{3^m}+u\mathbb{F}_{3^m}+u^2\mathbb{F}_{3^m}. Some illustrative examples are provided as well
    corecore