Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T21:04:39.992Z Has data issue: false hasContentIssue false

Recursively Generated Periodic Sequences

Published online by Cambridge University Press:  20 November 2018

R. P. Kurshan
Affiliation:
Bell Laboratories, Murray Hill, New Jersey
B. Gopinath
Affiliation:
Bell Laboratories, Murray Hill, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A sequence (xn ) (n = 1, 2, . . .) is periodic if xn+p = xn for some p and all n. Periodic sequences arise naturally in geometry and arithmetic in the study of mosaic patterns [4], continued fractions and frieze patterns [3; 5]. Some digital oscillators and tone generators also generate periodic sequences. In these cases one computes the period p of the sequence in question. On the other hand, in pseudo random sequences and cryptography [8] it is required to recursively generate sequences of large periods.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974