The linear complexity of a class of binary sequences with period \(2p\)
From MaRDI portal
Publication:499750
DOI10.1007/S00200-015-0261-8zbMath1397.94040OpenAlexW655823373MaRDI QIDQ499750
Publication date: 6 October 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-015-0261-8
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Theory of computing (68Q99)
Related Items (3)
The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation ⋮ Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences ⋮ Some new balanced and almost balanced quaternary sequences with low autocorrelation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- Binary sequences with optimal autocorrelation
- 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 the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- A class of balanced binary sequences with optimal autocorrelation properties
- Several classes of binary sequences with three-level autocorrelation
- New families of binary sequences with optimal three-level autocorrelation
This page was built for publication: The linear complexity of a class of binary sequences with period \(2p\)
