Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An approximate distribution for the maximum order complexity

From MaRDI portal
Publication:676727
Jump to:navigation, search

DOI10.1023/A:1008295603824zbMath0876.94014OpenAlexW1592642225MaRDI QIDQ676727

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)


Related Items (3)

Multisequences with high joint nonlinear complexity ⋮ Composition of recursions and nonlinear complexity of periodic binary sequences ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:676727&oldid=12587367"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki