Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (Q2567153): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generators and weights of polynomial codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm of polynomial complexity for factoring polynomials over local fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for polynomial factorization over \(\mathbb Q_p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The construction of maximal orders over a Dedekind domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over local fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated-root cyclic and negacyclic codes over a finite chain ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring modular polynomials / rank
 
Normal rank

Revision as of 16:03, 10 June 2024

scientific article
Language Label Description Also known as
English
Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
scientific article

    Statements

    Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (English)
    0 references
    29 September 2005
    0 references
    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).
    0 references
    primary polynomials
    0 references
    factoring polynomials
    0 references
    Galois rings
    0 references
    cyclic codes over rings
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references