Abstract
Abstract
We study the frequencies of tuples in linear recurring sequences (LRS) of vectors over Galois rings. By means of an estimate of an exponential sum some nontrivial bounds on the frequencies of elements in LRS are derived. It is shown that these bounds are in some cases sharper than known results.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. “Kerdock code in a cyclic form”;Discrete Math. Appl.,1991
2. “The Sidel’nikov method for estimating the number of signs on segments of linear recurrence sequences over Galois rings”;Math. Notes,2012
3. “Frequency characteristics of linear recurrence sequences over Galois rings”;Russian Acad. Sci. Sb. Math.,2009
4. “Estimates of the frequencies of the appearance of elements in linear recurrent sequences over Galois rings”;Fund. i prikl. matem.,2000
5. “Inversive congruential pseudorandom numbers over Galois rings”;Eur. J. Comb.,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献