Determining periodicity: a case study of a functional specification

DOI10.1080/0020739950260503zbMATH Open0885.94017OpenAlexW2072293532MaRDI QIDQ4359977FDOQ4359977

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

Recommendations

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

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)

Cites Work

• Analysis and design of stream ciphers
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• A Fast Monte-Carlo Test for Primality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)