Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-14T07:20:35.475Z Has data issue: false hasContentIssue false
  • English
  • Français

Linear Recurrences and Maximal Length Sequences

Published online by Cambridge University Press:  03 November 2016

R. R. Laxton  and
J. A. Anderson
R. R. Laxton
Affiliation:
Department of Mathematics, University of Nottingham
J. A. Anderson
Affiliation:
Department of Mathematics, University of Nottingham
Get access Rights & Permissions [Opens in a new window]

Extract

In this article, we are going to be looking at certain finite sequences composed of zeros and ones.

Type
Research Article
Information
The Mathematical Gazette , Volume 56 , Issue 398 , December 1972 , pp. 299 - 309
Copyright
Copyright © Mathematical Association 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

References and Further Reading

1. Armitage, J. V. and Griffiths, H. B.: A Companion to Advanced Mathematics. Cambridge (1969).Google Scholar
2. Golomb, S. W.: Shift Register Sequences. Holden-Day (1967).Google Scholar
3. Hammersley, J. M. and Handscomb, D. C.: Monte Carlo Methods. Methuen (1964).Google Scholar
4. Hardy, G. H. and Wright, E. M.: An Introduction to the Theory of Numbers. Oxford (1954).Google Scholar
5. Peterson, W. W.: Error Correcting Codes. M.I.T. Press and John Wiley (1961).Google Scholar
6. Ryser, H. J.: Combinatorial Mathematics. Carus Mathematical Monographs, MAA/Wiley (1963).CrossRefGoogle Scholar
7. Waerden, B. L. Van der: Modern Algebra, Vol. 1. Ungar, New York (1960).Google Scholar
8. Storer, T. W.: Cyclotomy and Difference Sets. Markham Pub. Co. (1967).Google Scholar