On self-dual cyclic codes over finite fields
WebIn coding theory, quasi-twisted (QJ) codes form an important class of codes which has been extensively studied. We decompose a QT code to a direct sum of component codes - linear codes over rings. Fu Web1 de abr. de 2024 · We examine cyclic codes over a finite commutative non-chain ring ℛ = F q [ u, v] / 〈 u 2 − γ u, v 2 − ϵ v, u v − v u 〉 for γ, ϵ ∈ F q * and its relevance in the generation of optimal LCD codes and comparatively new quantum codes. It is worth noting that the ring in [21] is a specific form of our fundamental ring ℛ (for γ ...
On self-dual cyclic codes over finite fields
Did you know?
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 ... WebA trace formula for quasi-cyclic codes over rings of characteristic not coprime with the co-index is derived. The main working tool is the Generalized Discrete Fourier Transform (GDFT), which in turn relies on the Hasse derivative of polynomials. A characterization of Type II self-dual quasi-cyclic codes of singly even co-index over finite fields of even …
Web14 de mar. de 2011 · Abstract: In coding theory, self-dual codes and cyclic codes are important classes of codes which have been extensively studied. The main objects of study in this paper are self-dual cyclic codes over finite fields, i.e., the intersection of these … Web31 de jan. de 2024 · Our goal of this paper is to find a construction of all ℓ-quasi-cyclic self-dual codes over a finite field Fq of length mℓ for every positive even integer ℓ. In this …
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 … Web10 de abr. de 2024 · Over finite fields, cyclic codes have been extensively investigated (see, for example, [2,3,4,5] and references therein). In 2015, from the cyclic codes over F q + v F q + v 2 F q + v 3 F q (where q = p m, p is a prime such that 3 (p − 1), v 4 = v, and m is a positive integer), Gao et al. constructed new quantum codes over F q.
Web30 de abr. de 2013 · G. K. Bakshi and M. Raka, Self-dual and self-orthogonal negacyclic codes of length $2p^n$ over a finite field, Finite Fields Appl., 19 (2013), 39-54.doi: 10.1016/j.ffa.2012.10.003. [2]
Web1 de jun. de 1999 · [Show full abstract] Terms: Codes over rings, Cyclic codes, Self-dual codes, Gray map. 1 Introduction Among the four rings of four elements, the Galois field … raynor cleaningWebOn Self-Dual Cyclic Codes over Finite Fields Yan Jia, San Ling, Chaoping Xing Abstract In coding theory, self-dual codes and cyclic codes are important classes of codes … raynor clip on door seal replacementWeb7 de nov. de 2024 · In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have never been reported. simplisafe sweaterWebFinally, we give some examples of self-dual, isodual, MDS and quasi-twisted codes corresponding to two-dimensional $(\alpha,\beta )$-constacyclic codes. Skip to search … raynor chairs companyWeb15 de abr. de 2024 · Cyclic code is one important type of codes. This type of codes over finite field Fq can be considered as ideals in quotient ring Fq[x] xn−1 , where n is the length of codes. Based on this point of view, we can determine generator of any cyclic code, its Euclidean dual, and its dimension. Moreover, in some cases, we can also design the … simplisafe system updateWeb15 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 ... simplisafe tech support hoursWeb3 de mar. de 2011 · In this paper we construct MDS Euclidean and Hermitian self-dual codes which are extended cyclic duadic codes or negacyclic codes. We also construct Euclidean self-dual codes which are extended negacyclic codes. Based on these constructions, a large number of new MDS self-dual codes are given with parameters … simplisafe system installation