Implementation of irreducible Sobol sequences in prime power bases

10/09/2019
by   H. Faure, et al.
0

We present different implementations for the irreducible Sobol (IS) sequences introduced in [3]. For this purpose we retain two strategies: first we use the connection between IS and Niederreiter sequences to provide a very simple implementation requiring no computer search; then we use criteria measuring the equidistribution to search for good parameters. Numerical results comparing these IS sequences to known implementations show promise for the proposed approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2022

Quadratic sequences with prime power discriminators

The discriminator of an integer sequence s = (s(i))_i ≥ 0, introduced by...
research
07/09/2018

Corrigendum to New Generalized Cyclotomic Binary Sequences of Period p^2

New generalized cyclotomic binary sequences of period p^2 are proposed i...
research
04/10/2019

On the k-error linear complexity of subsequences of d-ary Sidel'nikov sequences over prime field F_d

We study the k-error linear complexity of subsequences of the d-ary Side...
research
10/26/2022

A Nonlinear Sum of Squares Search for CAZAC Sequences

We report on a search for CAZAC sequences by using nonlinear sum of squa...
research
12/13/2019

Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products

This paper contributes to compute 2-adic complexity of two classes of Di...
research
09/15/2023

Do Random and Chaotic Sequences Really Cause Different PSO Performance? Further Results

Empirical results show that PSO performance may be different if using ei...
research
12/21/2021

Optimal Gap Sequences in Shellsort for n≤16 Elements

Optimal gap sequences in Shellsort, defined as gap sequences having the ...

Please sign up or login with your details

Forgot password? Click here to reset