You are looking at a specific version 20090815:023935 of this paper.
See the latest version.
Paper 2009/393
Permutation Polynomials modulo $p^n$}
Rajesh P Singh and Soumen Maity
Abstract
A polynomial $f$ over a finite ring $R$ is called a \textit{permutation polynomial} if the mapping $R\rightarrow R$ defined by $f$ is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient for it to represent a permutation. We also present a new class of permutation binomials over finite field of prime order.
Metadata
- Available format(s)
- PDF PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- r pratap @ iitg ernet in
- History
- 2009-08-15: received
- Short URL
- https://ia.cr/2009/393
- License
-
CC BY