Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90219-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006176786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of parallel multipliers for a class of fields \(GF(2^ m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal normal bases in \(GF(p^ n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to root finding in GT(q/sup m/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:30, 21 June 2024

scientific article
Language Label Description Also known as
English
Characterization for a family of infinitely many irreducible equally spaced polynomials
scientific article

    Statements

    Characterization for a family of infinitely many irreducible equally spaced polynomials (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithms
    0 references
    finite field
    0 references
    generator
    0 references
    irreducible polynomial
    0 references
    0 references