On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d

DOI10.1142/S0129054120500082zbMath1480.11160arXiv1904.05083OpenAlexW3022755348MaRDI QIDQ4983539

Jiejing Wen, Minghui Yang

Publication date: 20 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.05083

zbMATH Keywords

\(k\)-error linear complexitysubsequencesSidel'nikov sequences

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cites Work

• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• On the Autocorrelation Distributions of Sidel'nikov Sequences
• On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
• A class of balanced binary sequences with optimal autocorrelation properties
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d