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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
