On the number of multiples of certain primitive polynomials over GF(2)

DOI10.1515/MCMA.1996.2.1.15zbMATH Open0854.65129OpenAlexW2076088982MaRDI QIDQ4880908FDOQ4880908

Authors: Keizo Takashima 

Publication date: 29 July 1996

Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/mcma.1996.2.1.15

Recommendations

• On Hamming weight test and sojourn time test of m-sequences
• Periodic Binary Sequences: Solved and Unsolved Problems
• scientific article; zbMATH DE number 1494240

zbMATH Keywords

Monte Carlo methodsrandom number generationrandom walksstochastic simulationHamming weightscharacteristic polynomials of \(m\)-sequences

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) Probabilistic methods, stochastic differential equations (65C99) Sums of independent random variables; random walks (60G50) Pseudo-random numbers; Monte Carlo methods (11K45)

Cited In (2)

• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Weight discrepancy test on M-sequences

This page was built for publication: On the number of multiples of certain primitive polynomials over GF(2)

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