A Caltech Library Service

Linear recurring sequences over finite fields


McEliece, Robert James (1967) Linear recurring sequences over finite fields. Dissertation (Ph.D.), California Institute of Technology.


NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document.

This thesis deals with the problem of how the elements from a finite field F of characteristic p are distributed among the various linear recurrent sequences with a given fixed characteristic polynomial [...]. The first main result is a method of extending the so-called "classical method" for solving linear recurrences in terms of the roots of f. The main difficulty is that f might have a root [...] which occurs with multiplicity exceeding p-1; this is overcome by replacing the solutions [...], [...], [...], ..., by the solutions [...], [...], [...], .... The other main result deals with the number N of times a given element [...] appears in a period of the sequence, and for [...], the result is of the form [...] where [...] is an integer which depends upon f, but not upon the particular sequence in question. Several applications of the main results are given.

Item Type:Thesis (Dissertation (Ph.D.))
Degree Grantor:California Institute of Technology
Division:Physics, Mathematics and Astronomy
Major Option:Mathematics
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Hall, Marshall
Thesis Committee:
  • Unknown, Unknown
Defense Date:27 March 1967
Record Number:CaltechETD:etd-10012002-154611
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3856
Deposited By: Imported from ETD-db
Deposited On:02 Oct 2002
Last Modified:26 Dec 2012 03:03

Thesis Files

PDF (McEliece_rj_1967.pdf) - Final Version
See Usage Policy.


Repository Staff Only: item control page