Balance and pattern distribution of sequences derived from pseudorandom subsets of Zq

Abstract

Let q be a positive integer and S=\x0,x1,…,xT-1\⊂eqZq=\0,1,…,q-1\ with 0≤ x0<x1<…< xT-1≤ q-1. We derive from S three (finite) sequences. 1. For an integer M≥ 2 let (sn) be the M-ary sequence defined by eqnarray* sn xn+1-xn M, n=0,1,…, T-2. eqnarray* 2. For an integer m≥ 2 let (tn) be the binary sequence defined by eqnarray* tn=\arrayll 1, & if 1≤ xn+1-xn≤ m-1, \\ 0, & otherwise, array. n=0,1,…, T-2. eqnarray* 3. Let (un) be the characteristic sequence of S, eqnarray* un=\arrayll 1, & if n∈ S, \\ 0, & otherwise, array. n=0,1,…, q-1. eqnarray* We study the balance and pattern distribution of the sequences (sn), (tn) and (un). For sets S with desirable pseudorandom properties, more precisely, sets with low correlation measures, we show the following: 1. The sequence (sn) is (asymptotically) balanced and has uniform pattern distribution if T is of smaller order of magnitude than q. 2. The sequence (tn) is balanced and has uniform pattern distribution if T is approximately (1-121/(m-1))q. 3. The sequence (un) is balanced and has uniform pattern distribution if T is approximately q2. These results are motivated by earlier results for the sets of quadratic residues and primitive roots modulo a prime. We unify these results and derive many further (asymptotically) balanced sequences with uniform pattern distribution from pseudorandom subsets.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…