• DocumentCode
    1297316
  • Title

    Minimal Polynomial Algorithms for Finite Sequences

  • Author

    Norton, Graham H.

  • Author_Institution
    Dept. of Math., Univ. of Queensland, Brisbane, QLD, Australia
  • Volume
    56
  • Issue
    9
  • fYear
    2010
  • Firstpage
    4643
  • Lastpage
    4645
  • Abstract
    In this paper, we show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of an algorithm in a recent paper of A. Salagean.
  • Keywords
    binary sequences; computational complexity; finite sequences; minimal polynomial algorithms; Approximation algorithms; Computer science; Construction industry; Decoding; Integral equations; Iterative algorithms; Linear feedback shift registers; Mathematics; Polynomials; Berlekamp–Massey algorithm; Laurent polynomial; characteristic polynomial; finite sequence; minimal polynomial;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2010.2054150
  • Filename
    5550377
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1297316