Distribution of \(0\) and \(1\) in the heighest level of primitive sequences over \(\mathbb{Z}/(2^ e)\) (Q1367220)

Let \(f(x)\) be a primitive polynomial over the residue ring \({\mathbb{Z}}/(2^e)\), which means that \(\text{per}(f(x))=2^{e-1}(2^n-1)\) where \(n=\text{deg }f\). Let \(G(f(x))\) denote the set of all sequences over \({\mathbb{Z}}/(2^e)\) generated by \(f(x)\). Any sequence a over \({\mathbb{Z}}/(2^e)\) has a unique binary decomposition \(a= a-\{0\}+2a-\{1\}+\cdot+2^{e-1}a-\{e-1\}\) where \(a-\{i\}\) (\(0\leq i\leq e-1\)) is a binary sequence. The sequence \(a-\{e-1\}\) is called the highest level sequence of \(a\). Let \(N(a-\{e-1\},0)\) and \(N(a-\{e-1\},1)\) denote the number of 0s and 1s in a period of \(a-\{e-1\}\) respectively and \(G'(f(x))\) denote the set of all sequences \(a\) in \(G(f(x))\) with \(a-\{0\}\neq 0\). The authors prove in this paper that the proportion of sequences in \(G'(f(x))\) satisfy \[ (2^{d-k}-1)/(2^{d+k}+1)< N(a-\{e-1\},0)/N(a-\{e-1\},1)< (2^{d-k}+1)/(2^{d-k}-1) \] where \(d=[e/2]\) and \(0\leq k\leq d-1\) is at least \((2^k-1)/2^k\).