Web30 de abr. de 2024 · For any odd prime p, the structures and duals of λ -constacyclic codes of length 8 p s over R = F p m + u F p m are completely determined for all unit λ of the form λ = ξ l ∈ F p m, where l is even. In addition, the algebraic structures of all cyclic and negacyclic codes of length 8 p s over R are established in term of their generator … Web31 de dez. de 2011 · 1. It is of interest to know when cyclic self-orthogonal codes of length n over F q do not exist. The conditions, listed by Pless in [7] under which cyclic self-orthogonal codes can not exist, are not always sufficient. An example is given to assert this. Here we give the necessary and sufficient conditions under which cyclic self …
Construction of MDS Self-dual Codes over Finite Fields
Web19 de jul. de 2013 · On self-dual constacyclic codes over finite fields. This paper is devoted to the study of self-dual codes arising from constacyclic codes. Necessary and … Web15 de jun. de 2014 · Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied ... {\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. Comments: 22 ... the origin of the invar effect
Self-Dual and Complementary Dual Abelian Codes over Galois …
WebSELF-DUAL SKEW-CYCLIC CODES OVER FINITE FIELDS IRWANSYAH, INTAN MUCHTADI-ALAMSYAH, AHMAD MUCHLIS, ALEAMS BARRA, AND DJOKO SUPRIJANTO Abstract. In this paper, we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when (n, θ ) = 1 and for some cases WebNew MDS self-dual codes over finite fields 33 We recall that a cyclic code C of length n over Fq is an ideal of the ring R = Fq[x]/(xn −1) generated by a polynomial g(x) which divides xn −1.C is uniquely deter- mined by its defining set T ={0 ≤ i ≤ 1 g αi = 0}, where α is an nth primitive root of the unity. The set T is then a union of cyclotomic classes C(j) … WebThe only linear cyclic self-dual codes of length p over GR(p2,m) are p and (u −1)p−1 + p 2,p(u −1). Proof. If b = 0thenobviouslyp is self-dual. The case b = 1 leads to the invertible 1 ×1matrix M(p,1)=(2), and hence we obtain the self-dual code 1(u −1)p−1 + p 2,p(u −). Now we determine self-dual ideals in I for p =3 and small ... the origin of the guardians