Abstract
In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index bound given by Wan and Wang. As an application, we give an estimation of the number of all the solutions of some algebraic curves by using our result.
Similar content being viewed by others
References
Akbary A., Ghioca D., Wang Q.: On permutation polynomials of prescribed shape. Finite Fields Appl. 15(2), 195–206 (2009).
Cramer R., Xing C.: An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding. Adv. Math. 309, 238–253 (2017).
Gillot V.: Bounds for exponential sums over finite fields. Finite Fields Appl. 1(4), 421–436 (1995).
Gillot V., Langevin P.: Estimation of some exponential sum by means of \(q\)-degree. Glasg. Math. J. 52(2), 315–324 (2010).
Li C.: Hermitian LCD codes from cyclic codes. Des. Codes Cryptogr. 86(10), 2261–2278 (2018).
Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (2008).
Wan D., Wang Q.: Index bounds for character sums of polynomials over finite fields. Des. Codes Cryptogr. 81(3), 459–468 (2016).
Acknowledgements
The authors thank the anonymous reviewers for their helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue: On Coding Theory and Combinatorics: In Memory of Vera Pless”.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Y. Wu was sponsored by the National Natural Science Foundation of China (Grant No. 12101326) and the Natural Science Foundation of Jiangsu Province (Grant No. BK20210575). .
Rights and permissions
About this article
Cite this article
Wu, Y., Lee, Y. & Wang, Q. Further improvement on index bounds. Des. Codes Cryptogr. 90, 2813–2821 (2022). https://doi.org/10.1007/s10623-021-00987-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-021-00987-0