Properties of Bent Functions in the Truth Domain

Martin Lukáč, Claudio Moraga, Michitaka Kameyama

2019

Closed access Metadata (CSL-JSON)
DOI 10.1109/dt.2019.8813751
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In this paper we study bent functions in the truth vector domain. While in general bent functions are defined on the Walsh basis [-1,1] we look on their properties and classification in the standard Boolean basis [0,1]. We show that applying the Welsh transform to Boolean functions of n variables in the truth domain, results in a classification that allows to rank bent functions. We investigate the classification of bent vs non bent functions using standard machine learning and compare the performance difference. Finally we extend our search for efficient classification criteria to functions with smaller amount of variables and show the amount of classification possible.