A lower bound on the 2-adic complexity of the modified Jacobi sequence
From MaRDI portal
Publication:1733986
DOI10.1007/S12095-018-0300-YzbMath1409.94856arXiv1704.01685OpenAlexW2612667250MaRDI QIDQ1733986
Qiang Wang, Tongjiang Yan, Yuhua Sun
Publication date: 22 March 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.01685
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (6)
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\) ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\)
- Feedback shift registers, 2-adic span, and combiners with memory
- Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes
- 2-adic complexity of binary sequences with interleaved structure
- Sequences related to Legendre/Jacobi sequences
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences
- Constructions of Optimal 2-D Optical Orthogonal Codes via Generalized Cyclotomic Classes
- A New Method to Compute the 2-Adic Complexity of Binary Sequences
- Optimal Frequency Hopping Sequences of Odd Length
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique
- Pattern distributions of Legendre sequences
- $2$-Adic Complexity of Binary $m$-Sequences
- Cyclic Codes From the Two-Prime Sequences
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Modifications of Modified Jacobi Sequences
- New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- Shift-register synthesis and BCH decoding
- A family of difference sets
This page was built for publication: A lower bound on the 2-adic complexity of the modified Jacobi sequence
