Connection between primitive generators of GF(2n)

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root a of such a polynomial are delay operators on the generated sequence. Given two primitive polynomials of degree n with α1, and β2 their roots, it is shown which parameter is needed in order to find [formula omitted] from [formula omitted] without knowledge of x.

Original languageEnglish
Pages (from-to)223-225
Number of pages3
JournalElectronics Letters
Volume16
Issue number6
DOIs
StatePublished - 13 Mar 1980

Keywords

  • Codes
  • Polynomials
  • Sequences

Fingerprint

Dive into the research topics of 'Connection between primitive generators of GF(2<sup>n</sup>)'. Together they form a unique fingerprint.

Cite this