Determining periodicity: a case study of a functional specification

DOI10.1080/0020739950260503zbMath0885.94017OpenAlexW2072293532MaRDI QIDQ4359977

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

algorithmsperiodicitycryptographybinary 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
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• A Fast Monte-Carlo Test for Primality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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