Factoring polynomials over Z₄ and over certain Galois rings

DOI10.1016/J.FFA.2004.05.001MaRDI QIDQ2567153zbMATH OpenOpenAlexFDO

Authors Ana Sălăgean

Publication date 29 September 2005

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2004.05.001

zbMATH Keywords

cyclic codes over ringsfactoring polynomialsGalois ringsprimary polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials and finite commutative rings (13M10)

Review text

Beginning with an irreducibility criterion for polynomials over a Galois ring, this paper restricts to Galois rings of characteristic \(p^2\) (\(p\) prime). The paper fully describes factorisations of the primary polynomials in this case, giving also an algorithm. An interesting connection between the factorisation of a polynomial \(f\) and \(\text{GR}(p^2,\gamma)[x]//(f)\) being a principal ideal ring has also been noted. As an application, the results of the paper have been applied to factoring \(x^n-1\) and \(x^n+1\) over Galois rings of characteristic \(p^2\) (including \(\mathbb{Z}_4\) as an important special case).

Recommendations

• Factorization of polynomials over \(\mathbb{Z}/(p^n)\)
• Factoring modular polynomials
• Factoring polynomials over special finite fields
• Efficiently factoring polynomials modulo \(p^4\)
• scientific article; zbMATH DE number 1254268

Cites work

• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Algorithm of polynomial complexity for factoring polynomials over local fields
• Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings
• Factoring modular polynomials
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over local fields.
• Generators and weights of polynomial codes
• scientific article; zbMATH DE number 4035950 (Why is no real title available?)
• scientific article; zbMATH DE number 3460471 (Why is no real title available?)
• Repeated-root cyclic and negacyclic codes over a finite chain ring
• The construction of maximal orders over a Dedekind domain
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

Cited in

(6)

• Efficiently factoring polynomials modulo \(p^4\)
• Counting basic-irreducible factors \(\operatorname{mod} p^k\) in deterministic poly-time and \(p\)-adic applications
• Randomized polynomial-time root counting in prime power rings
• An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
• Solving polynomial systems over non-fields and applications to modular polynomial factoring
• Free double cyclic self-dual codes over \(\mathbb{Z}_4\)

This page was built for publication: Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567153)