Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-29T00:19:03.094Z Has data issue: false hasContentIssue false
  • English
  • Français

Non-Linear Recursive Sequences

Published online by Cambridge University Press:  20 November 2018

Elbert A. Walker
Elbert A. Walker*
Affiliation:
New Mexico State University
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.

The purpose of this paper is to investigate non-linear recursive sequences of maximum length with elements from GF(2). In particular, the question of whether or not a recursive sequence of maximum length can be equal to its dual is settled. This question, as far as the author knows, was originally asked by Rosser. Part I contains the necessary background for Part II, and in the main is a condensation of some unpublished work (1955) of W. A. Blankinship and R. P. Dilworth.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 11 , 1959 , pp. 370 - 378
Copyright
Copyright © Canadian Mathematical Society 1959

References

1. de Bruijn, N., A combinatorial problem, Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, 49 (Part 2) (1946), 758-64.Google Scholar