Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 (Q1340509): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:00, 5 March 2024

scientific article
Language Label Description Also known as
English
Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2
scientific article

    Statements

    Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 (English)
    0 references
    0 references
    28 August 1995
    0 references
    The author presents a new deterministic algorithm which gives a complete factorization of \(x^ n -1\) over a finite field \(F\) of characteristic 2. The main ideas are previously known ones adapted to treating \(F\) as a tower of extensions rather than as a simple extension. For example, the main overall idea is that the problem of factorization may be reduced to computing the set of primitive idempotents of the algebra \(F[ x]/ (x^ n-1)\).
    0 references
    deterministic algorithm
    0 references
    complete factorization of \(x^ n -1\)
    0 references
    finite field
    0 references
    tower of extensions
    0 references
    primitive idempotents
    0 references

    Identifiers