A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
From MaRDI portal
Publication:2173738
DOI10.1155/2020/5129450zbMath1435.94118arXiv2001.10839OpenAlexW3011319017MaRDI QIDQ2173738
Minghui Yang, Yang Yan, Qiuyan Wang, Chenhuang Wu
Publication date: 17 April 2020
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.10839
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Cyclotomy (11T22)
Cites Work
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Generalized cyclotomic numbers of order two and their applications
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Construction of quaternary sequences of length \(pq\) with low autocorrelation
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\)
- Binary sequences with optimal autocorrelation
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- New generalized cyclotomy and its applications
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- On cyclotomic generator of order \(r\).
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- Quadriphase sequences for spread- spectrum multiple-access communication
- A family of difference sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
