• DocumentCode
    2725133
  • Title

    Efficient evaluations of polynomials over finite fields

  • Author

    Schipani, Davide ; Elia, Michele ; Rosenthal, Joachim

  • Author_Institution
    Math. Inst., Univ. of Zurich, Zürich, Switzerland
  • fYear
    2011
  • fDate
    Jan. 31 2011-Feb. 3 2011
  • Firstpage
    154
  • Lastpage
    157
  • Abstract
    A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large with respect to the base field. Applications to the syndrome computation in the decoding of cyclic codes, Reed-Solomon codes in particular, are highlighted.
  • Keywords
    Reed-Solomon codes; cyclic codes; polynomials; Reed-Solomon codes; base field; cyclic code decoding; finite field; polynomial; syndrome computation; Complexity theory; Decoding; IEEE Press; Polynomials; Reed-Solomon codes; Polynomial evaluation; Reed-Solomon codes; finite fields; syndrome computation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications Theory Workshop (AusCTW), 2011 Australian
  • Conference_Location
    Melbourne, VIC
  • Print_ISBN
    978-1-4244-9714-0
  • Type

    conf

  • DOI
    10.1109/AUSCTW.2011.5728754
  • Filename
    5728754
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2725133