• DocumentCode
    1221653
  • Title

    Error detection for polynomial computations

  • Author

    Karpovsky, M.

  • Author_Institution
    State University of New York at Binghamton, Computer Science Department, School of Advanced Technology, Binghamton, USA
  • Volume
    2
  • Issue
    1
  • fYear
    1979
  • fDate
    2/1/1979 12:00:00 AM
  • Firstpage
    49
  • Lastpage
    56
  • Abstract
    We consider the problem of error detection in a process of computation of a polynomial over the field of complex numbers or over GF(p). By errors we mean errors in the text of a program or `stuck-at¿¿ errors in a device computing a polynomial. For error detection we use linear checks constructed by the technique of Fourier transformation over the group of binary vectors. Complexity estimations, optimal checks and estimations of the error-correcting capability of these checks are obtained.
  • Keywords
    computational complexity; error detection; Fourier transformation; linear checks; polynomial computation;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Journal on
  • Publisher
    iet
  • ISSN
    0140-1335
  • Type

    jour

  • DOI
    10.1049/ij-cdt.1979.0011
  • Filename
    4808604
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1221653