Sequences of numbers via permutation polynomials over some finite rings
Abstract A polynomial can represent every function from a finite field to itself. The functions which are also permutations of the field give rise to permutation polynomials, which have potential applications in cryptology and coding theory. Permutation polynomials over finite rings are studied with...
Guardado en:
Autores principales: | Vadiraja Bhatta,G. R., Shankar,B. R., Mishra,Vishnu Narayan, Poojary,Prasanna |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000501295 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
The number of inversions of permutations with fixed shape
por: Arvind Ayyer, et al.
Publicado: (2021) -
On generating functions of biorthogonal polynomials suggested by the Laguerre polynomials
por: Samanta,K. P., et al.
Publicado: (2014) -
Logical limit laws for layered permutations and related structures
por: Samuel Braunfeld, et al.
Publicado: (2021) -
An extension of Sheffer polynomials
por: Shukla,A. K, et al.
Publicado: (2011) -
On the three families of extended Laguerre-based Apostol-type polynomials
por: Pathan,M. A., et al.
Publicado: (2021)