On the quadratic spans of periodic sequences

4Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Random binaxy sequences are required in many applications of modern communication systems and in designing reliable circuits. However, truly random sequences are often associated with extremely high costs, and are therefore infeasible to use. Deterministically generated sequences that pass certain statistical tests suggested by random sequences are often used instead and are referred to as pseudorandom sequences. In applications involving, for instance, secure or spread spectrum communications, it is essential that these pseudorandom sequences be unpredictable. This paper addresses the problem of predicting the terms of a pseudorandom sequence from some initial portion of the sequence. A good introduction to the issues involved in this area can be found in [7].

Cite

CITATION STYLE

APA

Chan, A. H., & Games, R. A. (1990). On the quadratic spans of periodic sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 435 LNCS, pp. 82–89). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free