The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation
From MaRDI portal
Publication:894464
DOI10.1016/j.ipl.2015.09.007zbMath1350.94026OpenAlexW1796785622MaRDI QIDQ894464
A. Palvinskiy, Vladimir Edemskiy
Publication date: 1 December 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.007
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (3)
The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Binary periodic sequences with 2-level autocorrelation values
Cites Work
- The linear complexity of a class of binary sequences with period \(2p\)
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- Linear Complexity of Periodic Sequences: A General Theory
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- New families of binary sequences with optimal three-level autocorrelation
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation
