{"title":"New characterizations of generalized Boolean functions","authors":"Zhiyao Yang, Pinhui Ke, Zuling Chang","doi":"10.1007/s00200-024-00650-w","DOIUrl":null,"url":null,"abstract":"<p>This paper focuses on providing the characteristics of generalized Boolean functions from a new perspective. We first generalize the classical Fourier transform and correlation spectrum into what we will call the <span>\\(\\rho\\)</span>-Walsh–Hadamard transform (<span>\\(\\rho\\)</span>-WHT) and the <span>\\(\\rho\\)</span>-correlation spectrum, respectively. Then a direct relationship between the <span>\\(\\rho\\)</span>-correlation spectrum and the <span>\\(\\rho\\)</span>-WHT is presented. We investigate the characteristics and properties of generalized Boolean functions based on the <span>\\(\\rho\\)</span>-WHT and the <span>\\(\\rho\\)</span>-correlation spectrum, as well as the sufficient (or also necessary) conditions and subspace decomposition of <span>\\(\\rho\\)</span>-bent functions. We also derive the <span>\\(\\rho\\)</span>-autocorrelation for a class of generalized Boolean functions on <span>\\((n+2)\\)</span>-variables. Secondly, we present a characterization of a class of generalized Boolean functions with <span>\\(\\rho\\)</span>-WHT in terms of the classical Boolean functions. Finally, we demonstrate that <span>\\(\\rho\\)</span>-bent functions can be obtained from a class of composite construction if and only if <span>\\(\\rho =1\\)</span>. Some examples of non-affine <span>\\(\\rho\\)</span>-bent functions are also provided.</p>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s00200-024-00650-w","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper focuses on providing the characteristics of generalized Boolean functions from a new perspective. We first generalize the classical Fourier transform and correlation spectrum into what we will call the \(\rho\)-Walsh–Hadamard transform (\(\rho\)-WHT) and the \(\rho\)-correlation spectrum, respectively. Then a direct relationship between the \(\rho\)-correlation spectrum and the \(\rho\)-WHT is presented. We investigate the characteristics and properties of generalized Boolean functions based on the \(\rho\)-WHT and the \(\rho\)-correlation spectrum, as well as the sufficient (or also necessary) conditions and subspace decomposition of \(\rho\)-bent functions. We also derive the \(\rho\)-autocorrelation for a class of generalized Boolean functions on \((n+2)\)-variables. Secondly, we present a characterization of a class of generalized Boolean functions with \(\rho\)-WHT in terms of the classical Boolean functions. Finally, we demonstrate that \(\rho\)-bent functions can be obtained from a class of composite construction if and only if \(\rho =1\). Some examples of non-affine \(\rho\)-bent functions are also provided.
期刊介绍:
Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems.
Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology.
Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal.
On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.