Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings

DOI10.1016/J.FFA.2004.05.001zbMath1075.11078OpenAlexW2058779619MaRDI QIDQ2567153

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

Galois ringsfactoring polynomialsprimary polynomialscyclic codes over rings

Mathematics Subject Classification ID

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

Related Items (4)

An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item ⋮ Randomized polynomial-time root counting in prime power rings

Cites Work

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

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