arXiv subjects

Ayca Cesmelioglu

Publications and source records attributed to Ayca Cesmelioglu.

3 recordsLinked to original sources

arXiv2015

There are infinitely many bent functions for which the dual is not bent

Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also bent functions. In general this does not apply to non-weaky regular bent functions. However, the first known construction of non-weakly regular bent functions by Ceşmelioğlu et {\it al.}, 2012, yields bent functions for which the dual is also bent. In this paper the first construction of non-weakly regular bent functions for which the dual is not bent is presented. We call such functions non-dual-bent functions. Until now, only sporadic examples found via computer search were known. We then show that with the direct sum of bent functions and with the construction by Ceşmelioğlu et {\it al.} one can obtain infinitely many non-dual-bent functions once one example of a non-dual-bent function is known.

cs.IT↗

arXiv2010

A Construction of Weakly and Non-Weakly Regular Bent Functions

In this article a technique for constructing $p$-ary bent functions from near-bent functions is presented. Two classes of quadratic $p$-ary functions are shown to be near-bent. Applying the construction of bent functions to these classes of near-bent functions yields classes of non-quadratic bent functions. We show that one construction in even dimension yields weakly regular bent functions. For other constructions, we obtain both weakly regular and non-weakly regular bent functions. In particular we present the first known infinite class of non-weakly regular bent functions.

math.CO↗

arXiv2010

A Representation of Permutations with Full Cycle

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the prime field F_p, where p is an odd prime. We use the isomorphism between the symmetric group S_p of p elements and the group of PPs over F_p, and the well-known fact that permutations in S_p have the same cycle structure if and only if they are conjugate.

math.NT↗