The Maximum Order Complexity of Sequence Ensembles

DOI10.1007/3-540-46416-6_13MaRDI QIDQ4037461zbMATH OpenOpenAlexFDO

Authors Cees J. A. Jansen

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_13

zbMATH Keywords

maximum order complexitymaximum order feedback shift register

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorics on words (68R15)

Recommendations

• An approximate distribution for the maximum order complexity
• On the linear complexity of feedback registers
• Linear Complexity and Random Sequences
• On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
• scientific article; zbMATH DE number 4195880

Cited in

(8)

• scientific article; zbMATH DE number 4123670 (Why is no real title available?)
• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
• Multisequences with high joint nonlinear complexity
• An approximate distribution for the maximum order complexity
• Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field
• Correlation measure, linear complexity and maximum order complexity for families of binary sequences
• Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence

This page was built for publication: The Maximum Order Complexity of Sequence Ensembles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037461)