• DocumentCode
    1000111
  • Title

    Connection between primitive generators of GF(2n)

  • Author

    Arazi, Benjamin

  • Author_Institution
    Ben-Gurion University of the Negev, Department of Electrical Engineering, Beer-Sheva, Israel
  • Volume
    16
  • Issue
    6
  • fYear
    1980
  • Firstpage
    223
  • Lastpage
    225
  • Abstract
    Primitive polynomials over GF(2) are used for generating maximal-length sequences. Powers of a root ¿ 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 ¿1x from ¿2x without knowledge of x.
  • Keywords
    binary sequences; codes; polynomials; GF(2n); connection between primitive generators; delay operators; generating maximal length sequences;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19800160
  • Filename
    4249605
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1000111