Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A specific type of permutation and complete permutation polynomials over finite fields
Date
2020-04-01
Author
Ongan, Pinar
GÜLMEZ TEMÜR, BURCU
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
154
views
0
downloads
Cite This
In this paper, we study polynomials of the form f(x) = x (qn-1/q-1+1) + bx is an element of F-qn[x], where n = 5 and list all permutation polynomials (PPs) and complete permutation polynomials (CPPs) of this form. This type of polynomials were studied by Bassalygo and Zinoviev for the cases n = 2 and n = 3, Wu, Li, Helleseth and Zhang for the case n = 4, p not equal 2, Bassalygo and Zinoviev answered the question for the case n = 4, p= 2 and finally by Bartoli et al. for the case n = 6. Here, we determine all PPs and CPPs for the case n = 5.
Subject Keywords
Algebra and Number Theory
,
Applied Mathematics
URI
https://hdl.handle.net/11511/65584
Journal
JOURNAL OF ALGEBRA AND ITS APPLICATIONS
DOI
https://doi.org/10.1142/s021949882050067x
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
A new lower bound on the family complexity of Legendre sequences
Cakiroglu, Yagmur; Yayla, Oğuz (Springer Science and Business Media LLC, 2020-06-01)
In this paper we study a family of Legendre sequences and its pseudo-randomness in terms of their family complexity. We present an improved lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field. The new bound depends on the LambertWfunction and the number of elements in a finite field belonging to its proper subfield. Moreover, we present another lower bound which is a simplified version and approximates the new bound. We show that both bounds are b...
A generic identification theorem for L*-groups of finite Morley rank
Berkman, Ayse; Borovik, Alexandre V.; Burdges, Jeffrey; Cherfin, Gregory (Elsevier BV, 2008-01-01)
This paper provides a method for identifying "sufficiently rich" simple groups of finite Morley rank with simple algebraic groups over algebraically closed fields. Special attention is given to the even type case, and the paper contains a number of structural results about simple groups of finite Morley rank and even type.
A Survey on Oscillation of Impulsive Ordinary Differential Equations
Agarwal, Ravi P.; KARAKOÇ, FATMA; Zafer, Ağacık (Springer Science and Business Media LLC, 2010-01-01)
This paper summarizes a series of results on the oscillation of impulsive ordinary differential equations. We consider linear, half-linear, super-half-linear, and nonlinear equations. Several oscillation criteria are given. The Sturmian comparison theory for linear and half linear equations is also included.
On maximal curves and linearized permutation polynomials over finite fields
Özbudak, Ferruh (Elsevier BV, 2001-08-08)
The purpose of this paper is to construct maximal curves over large finite fields using linearized permutation polynomials. We also study linearized permutation polynomials under finite field extensions.
Almost p-ary sequences
Ozden, Busra; Yayla, Oğuz (Springer Science and Business Media LLC, 2020-11-01)
In this paper we study almost p-ary sequences and their autocorrelation coefficients. We first study the number l of distinct out-of-phase autocorrelation coefficients for an almost p-ary sequence of period n + s with s consecutive zero-symbols. We prove an upper bound and a lower bound on l. It is shown that l can not be less than min{s,p,n}. In particular, it is shown that a nearly perfect sequence with at least two consecutive zero symbols does not exist. Next we define a new difference set, partial dire...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
P. Ongan and B. GÜLMEZ TEMÜR, “A specific type of permutation and complete permutation polynomials over finite fields,”
JOURNAL OF ALGEBRA AND ITS APPLICATIONS
, pp. 0–0, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65584.