On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences

DOI10.1007/11863854_25MaRDI QIDQ3541931zbMATH OpenOpenAlexFDO

Authors Arne Winterhof, Igor E. Shparlinski

Publication date 27 November 2008

Published in Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11863854_25

zbMATH Keywords

counter-dependent generatordiscrepancylinear complexitynonlinear pseudorandom numbersrecurrence sequencesuniform distribution

Mathematics Subject Classification ID

Recurrences (11B37) Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 5174819
• Equidistribution properties of nonlinear congruential pseudorandom numbers
• On pseudorandom \([0,1)\) and binary sequences
• Statistical independence of nonlinear congruential pseudorandom numbers
• ON THE DISTRIBUTION OF COUNTER-DEPENDENT NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS IN RESIDUE RINGS

Cited in

(5)

• Average discrepancy, hyperplanes, and compound pseudorandom numbers
• Algebraic dependence in generating functions and expansion complexity
• scientific article; zbMATH DE number 5868120 (Why is no real title available?)
• An average bound for character sums with some counter-dependent recurrence sequences
• Bounds on the discrepancy of linear recurring sequences over Galois rings

This page was built for publication: On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences

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