Skip to main content

Finite Fields and Discrete Mathematics

  • Conference paper
Finite Fields: Theory and Computation

Part of the book series: Mathematics and Its Applications ((MAIA,volume 477))

  • 808 Accesses

Abstract

In this chapter we concentrate on new applications of finite fields which emerged quite recently. Such applications include, but are not limited to, cryptography, extremal graph theory, polynomial mappings and complexity theory which are extremely quickly developing areas posing a number exciting questions directly related to the theory of finite fields. Many classical applications of finite fields to such areas of discrete mathematics as combinatorics (in the construction of a number of combinatorial designs), finite geometries and to other areas of discrete mathematics have been described in [279, 280, 445, 1258, 1741, 1743, 1808, 2816], see also Chapters 5, 6, and 7 of this book. Here we only discuss several works, which have to do with new applications of finite fields.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Shparlinski, I.E. (1999). Finite Fields and Discrete Mathematics. In: Finite Fields: Theory and Computation. Mathematics and Its Applications, vol 477. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9239-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9239-0_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5203-2

  • Online ISBN: 978-94-015-9239-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics