Noisy interpolation of sparse polynomials in finite fields
โ Scribed by Igor Shparlinski; Arne Winterhof
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 160 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We develop efficient algorithms for computing the expansion of a given symmetric polynomial into Schur functions. This problem frequently arises in applications ลฝ as the problem of decomposing a given representation of the symmetric or general . linear group into irreducible constituents. Our algori
Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.