The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
From MaRDI portal
Publication:2130051
DOI10.1007/s12095-021-00534-7zbMath1487.94088OpenAlexW3198584488MaRDI QIDQ2130051
Nikita Sokolovskiy, Vladimir Edemskiy
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00534-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- New generalized cyclotomic binary sequences of period \(p^2\)
- Generalized GMW quadriphase sequences satisfying the Elch bound with equality
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm
- Optimal Frequency Hopping Sequences of Odd Length
- A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
