The Maximum Order Complexity of Sequence Ensembles

DOI10.1007/3-540-46416-6_13zbMath0791.68077OpenAlexW1833843757MaRDI QIDQ4037461

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) Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (5)

Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ Multisequences with high joint nonlinear complexity ⋮ Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field ⋮ On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences

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