Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Handbook of finite fields
Mullen G., Panario D., Chapman & Hall/CRC, Boca Raton, FL, 2013. 1068 pp. Type: Book (978-1-439873-78-6)
Date Reviewed: Sep 3 2014

If you want to play football, you go to a football field. If you want to play cricket, you go to a cricket field. But what if you want to play with numbers (with all four operations of addition, subtraction, multiplication, and division)? You need a field of numbers. When numbers of elements in the field are finite, we get a finite field. The smallest field (known as the binary field) has only two elements: zero and one. Our computers are based on this smallest field. We can safely say that modern information and communication technology (ICT) is based on finite fields. It provides reliability in ICT using error correction techniques from coding theory and provides security using cryptographic techniques from cryptography. The soul of coding and cryptography is finite fields.

Are you ready to play with finite fields? If you want to get some basic knowledge from a book and then dive into finite fields, this book is for you. This is not a textbook, but it provides comprehensive and up-to-date information in all areas of finite fields. It is divided into three parts. Part 1 gives a basic introduction to finite fields in two chapters. It begins with a historical introduction of the subject in chapter 1, continues to tables of irreducible polynomials in chapter 2, and concludes with a summary of open-source software. Part 2 provides beautiful theoretical properties for playing with finite fields in 11 chapters, covering such topics as irreducible polynomials, primitive polynomials, bases, exponential and character sums, equations over finite fields, permutation polynomials, special functions, sequences over finite fields, and curves over finite fields. Part 3 discusses applications in combinatorics, algebraic coding theory, and cryptography in the first three chapters. The last chapter deals with new fascinating and emerging areas where we find applications of finite fields, including biology, quantum computing, and some new areas in coding theory (such as space-time codes and network coding).

This book is a must-read for every electrical engineer, computer scientist, mathematician, and even biologist. They will find a wealth of information and ideas that can be used to understand various systems, build beautiful things, and even enjoy the power of algebra!

Reviewer:  Manish Gupta Review #: CR142688 (1411-0923)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Information Theory (H.1.1 ... )
 
 
General (G.2.0 )
 
 
Coding And Information Theory (E.4 )
 
 
Data Encryption (E.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Nonnumerical Algorithms And Problems": Date
Improving the performance guarantee for approximate graph coloring
Wigderson A. Journal of the ACM 30(4): 729-735, 1983. Type: Article
Feb 1 1985
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Demel J., Demlová M., Koubek V. Theoretical Computer Science 36(2-3): 203-216, 1985. Type: Article
Jan 1 1986
Complexity of the word problem for commutative semigroups of fixed dimension
Huynh D. Acta Informatica 22(4): 421-432, 1985. Type: Article
May 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy