• DocumentCode
    893210
  • Title

    Relationships between m-sequences over GF(q) and GF(qm)

  • Author

    Park, William J., Jr. ; Komo, John J.

  • Author_Institution
    Sch. of Eng., Univ. of the Pacific, Stockton, CA, USA
  • Volume
    35
  • Issue
    1
  • fYear
    1989
  • fDate
    1/1/1989 12:00:00 AM
  • Firstpage
    183
  • Lastpage
    186
  • Abstract
    It is shown that m-sequences over GF(qm ) of length qnm-1 corresponding to primitive polynomials in GF[qm,x] of degree n can be generated from known m-sequences over GF(q) of length qnm-1 obtained from primitive polynomials in GF[q,x] of degree mn. A procedure for generating the m-sequences over GF(q2) from m-sequences over GF(q) was given which enables the generation of m-sequences over GF( p2n). In addition it was shown that all of the primitive polynomials in GF[q,m,x] can be obtained from a complete set of the primitive polynomials in GF[q ,x]
  • Keywords
    codes; information theory; polynomials; GF(q); GF(qm); m-sequences; primitive polynomials; Autocorrelation; Deconvolution; Detectors; Equations; Information theory; Maximum likelihood detection; Maximum likelihood estimation; Polynomials; Recursive estimation; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.42190
  • Filename
    42190
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=893210