46,340 research outputs found

    Octal Bent Generalized Boolean Functions

    Get PDF
    In this paper we characterize (octal) bent generalized Boolean functions defined on \BBZ_2^n with values in \BBZ_8. Moreover, we propose several constructions of such generalized bent functions for both nn even and nn odd

    Landscape Boolean Functions

    Get PDF
    In this paper we define a class of Boolean and generalized Boolean functions defined on F2n\mathbb{F}_2^n with values in Zq\mathbb{Z}_q (mostly, we consider q=2kq=2^k), which we call landscape functions (whose class containing generalized bent, semibent, and plateaued) and find their complete characterization in terms of their components. In particular, we show that the previously published characterizations of generalized bent and plateaued Boolean functions are in fact particular cases of this more general setting. Furthermore, we provide an inductive construction of landscape functions, having any number of nonzero Walsh-Hadamard coefficients. We also completely characterize generalized plateaued functions in terms of the second derivatives and fourth moments.Comment: 19 page

    A Further Study of Vectorial Dual-Bent Functions

    Full text link
    Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study vectorial dual-bent functions F:Vn(p)β†’Vm(p)F: V_{n}^{(p)}\rightarrow V_{m}^{(p)}, where 2≀m≀n22\leq m \leq \frac{n}{2}, Vn(p)V_{n}^{(p)} denotes an nn-dimensional vector space over the prime field Fp\mathbb{F}_{p}. We give new characterizations of certain vectorial dual-bent functions (called vectorial dual-bent functions with Condition A) in terms of amorphic association schemes, linear codes and generalized Hadamard matrices, respectively. When p=2p=2, we characterize vectorial dual-bent functions with Condition A in terms of bent partitions. Furthermore, we characterize certain bent partitions in terms of amorphic association schemes, linear codes and generalized Hadamard matrices, respectively. For general vectorial dual-bent functions F:Vn(p)β†’Vm(p)F: V_{n}^{(p)}\rightarrow V_{m}^{(p)} with F(0)=0,F(x)=F(βˆ’x)F(0)=0, F(x)=F(-x) and 2≀m≀n22\leq m \leq \frac{n}{2}, we give a necessary and sufficient condition on constructing association schemes. Based on such a result, more association schemes are constructed from vectorial dual-bent functions
    • …
    corecore