• DocumentCode
    1174888
  • Title

    Permutation polynomials and nonsingular feedback shift registers over finite fields

  • Author

    Mullen, G.L.

  • Author_Institution
    Dept. of Math., Pennsylvania State Univ., Univ. Park, PA
  • Volume
    35
  • Issue
    4
  • fYear
    1989
  • fDate
    7/1/1989 12:00:00 AM
  • Firstpage
    900
  • Lastpage
    902
  • Abstract
    A necessary and sufficient condition is established for nonsingularity of a feedback shift-register of degree at most two over a finite field. Several relations between permutation polynomials and nonsingular feedback shift-registers over finite fields are also studied. Four theorems are given and discussed
  • Keywords
    binary sequences; feedback; information theory; polynomials; shift registers; feedback shift registers; finite fields; necessary and sufficient condition; nonsingularity; permutation polynomials; Ash; Convolutional codes; Decoding; Error probability; Feedback; Galois fields; Memory; Polynomials; Shift registers; Sufficient conditions;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.32171
  • Filename
    32171
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1174888