• DocumentCode
    1305389
  • Title

    Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence

  • Author

    Fitzpatrick, Patrick ; Norton, Graham H.

  • Author_Institution
    Dept. of Math., Univ. Coll., Cork, Ireland
  • Volume
    36
  • Issue
    6
  • fYear
    1990
  • fDate
    11/1/1990 12:00:00 AM
  • Firstpage
    1480
  • Lastpage
    1487
  • Abstract
    An n-dimensional linear recurring sequence (σ) of elements from a field F, for n⩾1 is considered. An algorithm χ-BASE which determines a basis for the ideal characteristic polynomials of (σ) under certain reasonable conditions is presented. This analysis applied to doubly periodic arrays in particular
  • Keywords
    codes; information theory; polynomials; characteristic ideal basis algorithm; codes; doubly periodic arrays; ideal characteristic polynomials; n-dimensional linear recurring sequence; Basis algorithms; Information theory; Mathematics; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.59953
  • Filename
    59953
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1305389