An approximate distribution for the maximum order complexity

DOI10.1023/A:1008295603824MaRDI QIDQ676727zbMATH OpenOpenAlexFDO

Authors Diane Erdmann, Sean Murphy

Publication date 13 November 1997

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008295603824

zbMATH Keywords

stream cipherbinary sequencefeedback shift-registermaximum order complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 962463
• The complexity of distributions
• scientific article; zbMATH DE number 3942146
• On the complexity of computational problems regarding distributions
• scientific article; zbMATH DE number 740346
• The Maximum Order Complexity of Sequence Ensembles
• On the distribution function of the complexity of finite sequences
• Approximation complexity of sums of random processes
• scientific article; zbMATH DE number 3954271

Cited in

(5)

• The Maximum Order Complexity of Sequence Ensembles
• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Multisequences with high joint nonlinear complexity
• Composition of recursions and nonlinear complexity of periodic binary sequences

This page was built for publication: An approximate distribution for the maximum order complexity

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