On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences

DOI10.1007/978-3-642-15874-2_11zbMath1257.94020OpenAlexW13617199MaRDI QIDQ3588583

Xianhua Niu, Xiaohu Tang, Daiyuan Peng, Fang Liu

Publication date: 8 September 2010

Published in: Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15874-2_11

zbMATH Keywords

linear complexityautocorrelationbalancegeneralized cyclotomyprime \(n\)-square sequence

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 (5)

Design sequences with high linear complexity over finite fields using generalized cyclotomy ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Autocorrelation values of quaternary cyclotomic sequence of length 2pm ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\)

This page was built for publication: On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences