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.
منابع مشابه
Linear complexity of quaternary sequences of length pq with low autocorrelation
The linear complexity L, of a sequence is an important parameter in its evaluation as a key stream cipher for cryptographic applications. Ideally, good sequences combine the autocorrelation properties of a random sequence with high linear complexity. Cyclotomic and generalized cyclotomic sequences are important pseudorandom sequences in stream ciphers due to their good pseudorandom cryptographi...
متن کاملAbout the Linear Complexity of Binary Sequences with Optimal Autocorrelation Value/Magnitude and Length 4p
We derive the linear complexity and the minimal polynomial over the finite fields of order two and p of series of binary sequences with a period 4p and optimal autocorrelation value/magnitude. These sequences are constructed by cyclotomic classes of order two, four and six by methods proposed by K.T. Arasu et al. and Y. Sun et al. We define the parameters of sequences with optimal autocorrelati...
متن کاملRelation Between RNA Sequences, Structures, and Shapes via Variation Networks
Background: RNA plays key role in many aspects of biological processes and its tertiary structure is critical for its biological function. RNA secondary structure represents various significant portions of RNA tertiary structure. Since the biological function of RNA is concluded indirectly from its primary structure, it would be important to analyze the relations between the RNA sequences and t...
متن کاملUsing of Generalized Cyclotomy for Sequence Design over the Finite Field of Order Four with High Linear Complexity
We consider the use of generalized Ding-Helleseth cyclotomy to design sequences over the finite field of order four. Using generalized cyclotomic classes of order four we obtain the family of balanced sequences of odd period with high linear complexity. Also we present a method of constructing sequences with high linear complexity and arbitrary even period over the finite field of order four. T...
متن کاملOn linear complexity of sequences over GF(2n)
In this paper, we consider some aspects related to determining the linear complexity of sequences over GF(2n). In particular, we study the effect of changing the finite field basis on the minimal polynomials, and thus on the linear complexity, of sequences defined overGF(2n) but given in their binary representation. Let a={ai} be a sequence overGF(2n). Then ai can be represented by ai = ∑n−1 j=...
متن کامل