A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)

DOI10.1109/18.868492zbMath0997.94013OpenAlexW1973087330MaRDI QIDQ2705945

Guozhen Xiao, Shimin Wei, Kyoki Imamura, Kwok-Yan Lam

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.868492

zbMATH Keywords

algorithmcryptographylinear complexitycodesperiodic 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) Cryptography (94A60)

Related Items (15)

Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) ⋮ Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) ⋮ A new complexity metric for FH/SS sequences using fuzzy entropy ⋮ Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ Distribution of one-error linear complexity of binary sequences for arbitrary prime period ⋮ Quadratic functions with prescribed spectra ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ On the error linear complexity spectrum of \(p^n\)-periodic binary sequences ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Erratum to: ``On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences ⋮ On the stability of periodic binary sequences with zone restriction

This page was built for publication: A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)