The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 602
S.R. Kumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
D. Sivakumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
The authors consider the problem of designing self-testers/self-correctors for functions defined by linear recurrences. They present the first complete package of efficient and simple self-testers, self-correctors, and result-checkers for such functions. The results are proved by demonstrating an efficient reduction from this problem to the problem of testing linear functions over certain matrix groups. The tools include spectral analysis of matrices over finite fields, and various counting arguments that extend known techniques. The matrix twist yields simple and efficient self-testers for all linear recurrences. They also show a technique of using convolution identities to obtain very simple self-testers and self correctors. Their techniques promise new and efficient ways of testing VLSI chips for applications in control engineering, signal processing, etc. An interesting consequence of their methods is a completely new and randomness-efficient self-tester for polynomials over finite fields and rational domains. In particular the self-tester for polynomials over rational domains overcomes a main drawback of the result of Rubinfeld and Sudan (1992)-the need for a test domain of much larger size and of much finer precision.
program testing; linear recurrences; efficient self-testing; efficient self-correction; functions; self-tester design; self-corrector design; result-checkers; reduction; linear function testing; matrix groups; spectral analysis; finite fields; counting arguments; matrix twist; convolution identities; VLSI chip testing; control engineering; signal processing; randomness-efficient self-tester; polynomials; rational domains

S. Kumar and D. Sivakumar, "Efficient self-testing/self-correction of linear recurrences," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 602.
102 ms
(Ver 3.3 (11022016))