Remarks on the generalized cyclotomic sequences of length \(2p^m\)

DOI10.1007/s00200-012-0177-5zbMath1253.94039OpenAlexW2031729741MaRDI QIDQ1928788

Lin Tan, Wen-Feng Qi, Hong Xu

Publication date: 4 January 2013

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-012-0177-5

zbMATH Keywords

linear complexityautocorrelation\(k\)-error linear complexitycyclotomic sequences

Mathematics Subject Classification ID

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

Related Items (2)

On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
• Remarks on a cyclotomic sequence
• The stability theory of stream ciphers
• Linear complexity of generalized cyclotomic binary sequences of order 2
• New generalized cyclotomy and its applications
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
• A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Autocorrelation values of generalized cyclotomic sequences of order two
• Linear Complexity and Autocorrelation of Prime Cube Sequences

This page was built for publication: Remarks on the generalized cyclotomic sequences of length \(2p^m\)