About the linear complexity of quaternary sequences with even length

DOI10.1007/s12095-019-00419-wzbMath1453.94054OpenAlexW2995465855WikidataQ126589157 ScholiaQ126589157MaRDI QIDQ2202912

Lu Zhao

Publication date: 30 September 2020

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-019-00419-w

zbMATH Keywords

finite fieldGalois ringlinear complexityquaternary sequenceinterleaved structure

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (3)

SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER ⋮ TWO-VARIABLE FUNCTION TO DESIGN INTERLEAVED SEQUENCES ON ⋮ Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\)

Cites Work

• Linear complexity of generalized cyclotomic binary sequences of order 2
• Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
• Shift Register Synthesis (Modulo m)
• New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
• Unnamed Item

This page was built for publication: About the linear complexity of quaternary sequences with even length