On the linear complexity of functions of periodic GF(q) sequences

DOI10.1109/18.42178zbMath0678.12006OpenAlexW2080084891MaRDI QIDQ3834146

Jovan Dj. Golić

Publication date: 1989

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

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

zbMATH Keywords

linear complexityperiodic sequence over finite fields

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Synchronization error-correcting codes (94B50)

Related Items (5)

Linear recurring sequences over rings and modules ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ Novel way to research nonlinear feedback shift register

This page was built for publication: On the linear complexity of functions of periodic GF(q) sequences