A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q2762882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Normal Bases for Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Trinomials of High Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Binary Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Polynomials (Mod 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theorem of Gleason and Marsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive trinomials whose degree is a Mersenne exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On xn + x + 1 over GF(2) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0025-5718-02-01478-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079168443 / rank
 
Normal rank

Latest revision as of 11:47, 30 July 2024

scientific article; zbMATH DE number 1910551
Language Label Description Also known as
English
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
scientific article; zbMATH DE number 1910551

    Statements

    A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducible polynomials
    0 references
    irreducible trinomials
    0 references
    primitive polynomials
    0 references
    primitive trinomials
    0 references
    Mersenne exponents
    0 references
    Mersenne numbers
    0 references
    random number generators
    0 references
    0 references
    0 references