Recursive construction of normal polynomials over finite fields (Q5059602): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1080/09720529.2021.1897215 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213186808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improvements of the<i>r</i>-adding walk in a finite field of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive constructions of irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of self-reciprocal normal polynomials over finite fields of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroidal root structure of skew polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irreducible polynomials of certain types in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive constructions of k-normal polynomials using some rational transformations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated constructions of irreducible polynomials over finite fields with linearly independent roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit N-polynomials of \(2\)-power degree over finite fields. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems / rank
 
Normal rank

Latest revision as of 05:53, 31 July 2024

scientific article; zbMATH DE number 7637289
Language Label Description Also known as
English
Recursive construction of normal polynomials over finite fields
scientific article; zbMATH DE number 7637289

    Statements

    Recursive construction of normal polynomials over finite fields (English)
    0 references
    0 references
    0 references
    0 references
    23 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    finite field
    0 references
    irreducible polynomial
    0 references
    normal polynomial
    0 references
    self -reciprocal polynomial
    0 references
    0 references