New generalized cyclotomic binary sequences of period \(p^2\)
From MaRDI portal
Publication:1647562
DOI10.1007/s10623-017-0408-7zbMath1391.94718arXiv1807.03088OpenAlexW3102572112MaRDI QIDQ1647562
Chunlei Li, Zibi Xiao, Tor Helleseth, Xiangyong Zeng
Publication date: 26 June 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.03088
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$ ⋮ The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation ⋮ Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\) ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\) ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\) ⋮ On the properties of generalized cyclotomic binary sequences of period \(2p^m\) ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- A generalization of the Hall's sextic residue sequences
- Optimal Frequency Hopping Sequences of Odd Length
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Several classes of binary sequences with three-level autocorrelation
- On the linear complexity of Hall's sextic residue sequences
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Linear Complexity of Some Generalized Cyclotomic Sequences
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- Linear Complexity and Autocorrelation of Prime Cube Sequences
- Progress in Cryptology - INDOCRYPT 2003
- The Linear Generation of the Legendre Sequence
- A family of difference sets
