Applying Coding Theory to Sparse Interpolation (Q3137705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applying Coding Theory to Sparse Interpolation |
scientific article; zbMATH DE number 428573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applying Coding Theory to Sparse Interpolation |
scientific article; zbMATH DE number 428573 |
Statements
Applying Coding Theory to Sparse Interpolation (English)
0 references
10 October 1993
0 references
sparse multivariate polynomials
0 references
fast interpolation algorithms
0 references
linear sums of characters
0 references
interpolation
0 references
finite field
0 references
Reed-Solomon codes
0 references
Boolean polynomials
0 references
Reed-Muller codes
0 references
0.8554970026016235
0 references
0.8512502312660217
0 references
0.8130308389663696
0 references
0.8049629926681519
0 references
0.7940582036972046
0 references
