A lower bound on the 2-adic complexity of the modified Jacobi sequence
From MaRDI portal
Abstract: Let be distinct primes satisfying and let , , be Whiteman's generalized cyclotomic classes with . In this paper, we give the values of Gauss periods based on the generalized cyclotomic sets and . As an application, we determine a lower bound on the 2-adic complexity of modified Jacobi sequence. Our result shows that the 2-adic complexity of modified Jacobi sequence is at least with period . This indicates that the 2-adic complexity of modified Jacobi sequence is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).
Recommendations
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
- Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
- 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
- Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
Cites work
- 2-Adic Complexity of Binary m-Sequences
- 2-adic complexity of binary sequences with interleaved structure
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- A family of difference sets
- A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique
- A New Method to Compute the 2-Adic Complexity of Binary Sequences
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- Constructions of Optimal 2-D Optical Orthogonal Codes via Generalized Cyclotomic Classes
- Cyclic Codes From the Two-Prime Sequences
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Feedback shift registers, 2-adic span, and combiners with memory
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- scientific article; zbMATH DE number 2110656 (Why is no real title available?)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Modifications of Modified Jacobi Sequences
- New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
- Optimal Frequency Hopping Sequences of Odd Length
- Pattern distributions of Legendre sequences
- Sequences related to Legendre/Jacobi sequences
- Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes
- Shift-register synthesis and BCH decoding
Cited in
(9)- Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
- Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
- On the 4-adic complexity of the two-prime quaternary generator
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
- On the 2-adic complexity of cyclotomic binary sequences of order three
- On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
- Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
- Linear complexity and 2-adic complexity of new cyclotomic binary sequences of order four with low autocorrelation
- On the 2-adic complexity of cyclotomic binary sequences of order four
This page was built for publication: A lower bound on the 2-adic complexity of the modified Jacobi sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733986)