859 research outputs found

    Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform

    Full text link
    We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity and structure of some graphs that correspond to codes with high distance. The codes can also be interpreted as quadratic Boolean functions, where inequivalence takes on a spectral meaning. In this context we define PAR_IHN, peak-to-average power ratio with respect to the {I,H,N}^n transform set. We prove that PAR_IHN of a Boolean function is equivalent to the the size of the maximum independent set over the associated orbit of graphs. Finally we propose a construction technique to generate Boolean functions with low PAR_IHN and algebraic degree higher than 2.Comment: Presented at Sequences and Their Applications, SETA'04, Seoul, South Korea, October 2004. 17 pages, 10 figure

    On Walsh Spectrum of Cryptographic Boolean Function

    Get PDF
    Walsh transformation of a Boolean function ascertains a number of cryptographic properties of the Boolean function viz, non-linearity, bentness, regularity, correlation immunity and many more. The functions, for which the numerical value of Walsh spectrum is fixed, constitute a class of Boolean functions known as bent functions. Bent functions possess maximum possible non-linearity and therefore have a significant role in design of cryptographic systems. A number of generalisations of bent function in different domains have been proposed in the literature. General expression for Walsh transformation of generalised bent function (GBF) is derived. Using this condition, a set of Diophantine equations whose solvability is a necessary condition for the existence of GBF is also derived. Examples to demonstrate how these equations can be utilised to establish non-existence and regularity of GBFs is presented

    On Self-Dual Quantum Codes, Graphs, and Boolean Functions

    Get PDF
    A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond to equivalent quantum codes if they are related by a sequence of local complementations. We use this operation to generate orbits of graphs, and thus classify all inequivalent self-dual additive codes over GF(4) of length up to 12, where previously only all codes of length up to 9 were known. We show that these codes can be interpreted as quadratic Boolean functions, and we define non-quadratic quantum codes, corresponding to Boolean functions of higher degree. We look at various cryptographic properties of Boolean functions, in particular the propagation criteria. The new aperiodic propagation criterion (APC) and the APC distance are then defined. We show that the distance of a zero-dimensional quantum code is equal to the APC distance of the corresponding Boolean function. Orbits of Boolean functions with respect to the {I,H,N}^n transform set are generated. We also study the peak-to-average power ratio with respect to the {I,H,N}^n transform set (PAR_IHN), and prove that PAR_IHN of a quadratic Boolean function is related to the size of the maximum independent set over the corresponding orbit of graphs. A construction technique for non-quadratic Boolean functions with low PAR_IHN is proposed. It is finally shown that both PAR_IHN and APC distance can be interpreted as partial entanglement measures.Comment: Master's thesis. 105 pages, 33 figure

    Weight of quadratic forms and graph states

    Full text link
    We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results concerning the weight of quadratic forms in terms of graph states properties. As a byproduct, we obtain a straightforward characterization of the weight of functions associated with pivot-minor of bipartite graphs.Comment: 8 pages, 3 eps figure, REVTeX; v2: We have extended the introduction, included extra references and added two figures; v3: small typos fixe
    • …
    corecore