The linear complexity of balanced quaternary sequences with optimal autocorrelation value
From MaRDI portal
Publication:892508
DOI10.1007/s12095-015-0130-0zbMath1365.94377OpenAlexW2085922776MaRDI QIDQ892508
Publication date: 19 November 2015
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0130-0
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (5)
Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) ⋮ An extension of binary cyclotomic sequences having order 2lt ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation ⋮ 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of quaternary sequences of length \(pq\) with low autocorrelation
- Quadriphase sequences for spread- spectrum multiple-access communication
- Kerdock code in a cyclic form
- Binary and quadriphase sequences with optimal autocorrelation properties: a survey
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
This page was built for publication: The linear complexity of balanced quaternary sequences with optimal autocorrelation value