Determining periodicity: a case study of a functional specification

DOI10.1080/0020739950260503MaRDI QIDQ4359977zbMATH OpenOpenAlexFDO

Authors V. J. Rayward-Smith, Adnan E. Omar

Publication date 25 November 1997

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739950260503

zbMATH Keywords

algorithmscryptographyperiodicitybinary sequencefunctional programming language Miranda

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Parallel algorithms in computer science (68W10)

Recommendations

• A new approach for testing periodicity
• Testing periodicity
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Estimating the frequency of a periodic function

Cites work

• scientific article; zbMATH DE number 3915608 (Why is no real title available?)
• scientific article; zbMATH DE number 3792089 (Why is no real title available?)
• scientific article; zbMATH DE number 41062 (Why is no real title available?)
• scientific article; zbMATH DE number 44593 (Why is no real title available?)
• scientific article; zbMATH DE number 176067 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• Analysis and design of stream ciphers
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality

This page was built for publication: Determining periodicity: a case study of a functional specification

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