An improvement on Weil bounds for character sums of polynomials over finite fields
From MaRDI portal
Publication:6587221
DOI10.1007/S12095-024-00706-1MaRDI QIDQ6587221FDOQ6587221
Authors: Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue 
Publication date: 13 August 2024
Published in: Cryptography and Communications (Search for Journal in Brave)
Recommendations
Cites Work
- ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
- Cyclotomy and permutation polynomials of large indices
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- On permutation polynomials of prescribed shape
- A note on character sums with polynomial arguments.
- Bounds for exponential sums over finite fields
- A Gauss sum estimate in arbitrary finite fields
- Constructions of near MDS codes which are optimal locally recoverable codes
- Index bounds for character sums of polynomials over finite fields
- Estimation of some exponential sum by means of \(q\)-degree
- Bounds of Gauss sums in finite fields
- An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding
- New Extension of the Weil Bound for Character Sums with Applications to Coding
- Improvements of the Weil bound for Artin-Schreier curves
- Further improvement on index bounds
- Three Families of Monomial Functions With Three-Valued Walsh Spectrum
- Binary and ternary sequences with a few cross correlations
- Several classes of exponential sums and three-valued Walsh spectrums over finite fields
- Constructions of cyclic codes and extended primitive cyclic codes with their applications
This page was built for publication: An improvement on Weil bounds for character sums of polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587221)
