Linear complexity of Legendre-polynomial quotients
نویسنده
چکیده
We continue to investigate binary sequence (fu) over {0, 1} defined by (−1)fu = ( (u−u)/p p ) for integers u ≥ 0, where ( · p ) is the Legendre symbol and we restrict ( 0 p ) = 1. In an earlier work, the linear complexity of (fu) was determined for w = p − 1 under the assumption of 2p−1 6≡ 1 (mod p2). In this work, we give possible values on the linear complexity of (fu) for all 1 ≤ w < p− 1 under the same conditions. We also state that the case of larger w(≥ p) can be reduced to that of 0 ≤ w ≤ p− 1.
منابع مشابه
On the Linear Complexity of Legendre Sequences - Information Theory, IEEE Transactions on
In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.
متن کاملOn $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
We investigate the k-error linear complexity of pseudorandom binary sequences of period pr derived from the Euler quotients modulo pr−1, a power of an odd prime p for r ≥ 2. When r = 2, this is just the case of polynomial quotients (including Fermat quotients) modulo p, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the k-error ...
متن کاملAbout the linear complexity of sequences over the finite field obtained by inverse Gray mapping from binary sequences
We consider the sequences over the finite field of four elements obtained by inverse Gray mapping from a pair of binary sequences. We derive the linear complexity and the minimal polynomial of sequences constructed from Legendre sequences, Hall’s sextic sequences and twin-prime sequences using the technique proposed by Tang, Ding, Lim, Kim et al.
متن کاملTrace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences
In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multi-rate parallel combinations of binary Legendre sequences which are clocked at different rates. Then these generalized cyclotomic sequences can be generated by combinations of short and cheap LFSR’s. From the multi-rate constructions and the trace representation of binary Legendre seque...
متن کاملPseudospectral Fourier reconstruction with IPRM
The Inverse Polynomial Reconstruction Method (IPRM) has been recently introduced by J.-H. Jung and B. Shizgal in order to remedy the Gibbs phenomenon, see [2], [3], [4], [5]. Their main idea is to reconstruct a given function from its n Fourier coefficients as an algebraic polynomial of degree n− 1. This leads to an n × n system of linear equations, which is solved to find the Legendre coeffici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.01380 شماره
صفحات -
تاریخ انتشار 2017