Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
DOI10.1007/s10623-022-01068-6zbMath1495.94039arXiv2109.02095OpenAlexW4283365048WikidataQ114849707 ScholiaQ114849707MaRDI QIDQ2161414
Xilin Han, Weiqiong Wang, Yan Wang, Ziling Heng
Publication date: 4 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.02095
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
- Unnamed Item
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- New generalized cyclotomy and its applications
- Feedback shift registers, 2-adic span, and combiners with memory
- New generalized cyclotomic binary sequences of period \(p^2\)
- A lower bound on the 2-adic complexity of the modified Jacobi sequence
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
- Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
- A New Method to Compute the 2-Adic Complexity of Binary Sequences
- On the 2-Adic Complexity of the Two-Prime Generator
- $2$-Adic Complexity of Binary $m$-Sequences
- Shift-register synthesis and BCH decoding
This page was built for publication: Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
