Construction of a rank-1 lattice sequence based on primitive polynomials

zbMATH Open1368.11086MaRDI QIDQ2811681FDOQ2811681

Carsten Wächter, Alexander Keller, Nikolaus Binder

Publication date: 10 June 2016

Recommendations

• A construction of primitive polynomials over finite fields
• Construction of primitive polynomials over finite fields
• Construction of sequences of the rank 1 lattice cubature formulas that are exact on trigonometric polynomials
• Vector lattices of almost polynomial sequences
• scientific article; zbMATH DE number 3989453
• A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
• The construction of good extensible rank-1 lattices
• Primitive polynomials and m-sequences over GF(q/sup m/)
• On some Tutte polynomial sequences in the square lattice
• Primitive polynomial remainder sequences in elimination theory

zbMATH Keywords

primitive polynomialsSobol' sequencerank-1 lattice sequence

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Pseudo-random numbers; Monte Carlo methods (11K45)

Cited In (2)

• Simulation on Rank-1 Lattices
• Image Synthesis by Rank-1 Lattices

This page was built for publication: Construction of a rank-1 lattice sequence based on primitive polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811681)