Scalar Polynomial Functions on the NxN Matrices over a Finite Field.
Abstract
The use of the theory of finite fields in areas of discrete linear modeling such as coding theory, finite linear sequential machines, algebraic cryptography and the construction of block designs is well-known. Many times one has the task of constructing (based on a finite field) a function having certain prescribed properties. Of such a nature is the material contained in the report. In particular, the authors determined among other things, necessary and sufficient conditions on a polynomial f(x) with coefficients in a finite field F in order that it defines via substitution a one-one onto function (a permutation) from F(nxn), the nxn matrices over F, to F(nxn).
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 24, 1973
- Accession Number
- AD0766154
Entities
People
- J. V. Brawley
- Jack Levine
- L. Carlitz
Organizations
- Clemson University