Applying Coding Theory to Sparse Interpolation
- 1 August 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (4) , 695-704
- https://doi.org/10.1137/0222046
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On zero-testing and interpolation of k-sparse multivariate polynomials over finite fieldsTheoretical Computer Science, 1991
- The interpolation problem for k-sparse sums of eigenfunctions of operatorsAdvances in Applied Mathematics, 1991
- The interpolation problem for k-sparse polynomials and character sumsAdvances in Applied Mathematics, 1991
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite FieldsSIAM Journal on Computing, 1990
- Parallel Algorithms for Shared-Memory MachinesPublished by Elsevier ,1990
- Irreducible polynomials over finite fieldsPublished by Springer Nature ,1986
- Primality and CryptographyPublished by Springer Nature ,1986
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Codes over integer residue ringsInformation and Control, 1975
- Codes over certain ringsInformation and Control, 1972