Families of \(p\)-ary sequences with low correlation and large linear complexity

DOI10.1007/s11424-014-1243-9zbMath1317.94073OpenAlexW1977307972MaRDI QIDQ2341595

Han Cai, Lei Hu, Xiangyong Zeng

Publication date: 27 April 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-014-1243-9

zbMATH Keywords

linear complexitycross-correlation\(p\)-ary sequencelow correlationauto-correlation

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Kasami Sequences: The Large Set
• Bent-function sequences
• Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Binary sequences with Gold-like correlation but larger linear span
• New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
• Theory and applications of q-ary interleaved sequences
• New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
• New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
• Shift-register synthesis and BCH decoding
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Coding and Cryptography

This page was built for publication: Families of \(p\)-ary sequences with low correlation and large linear complexity