Computer Science – Information Theory
Scientific paper
2005-02-09
Computer Science
Information Theory
18 pages, submitted to IEEE Trans. Inform. Theory
Scientific paper
In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}^n, {H,N}^n and {I,H,N}^n were presented, and the relevance of Local Complementation to the quadratic case was indicated. In this second part, the results are applied to develop recursive formulae for the numbers of flat spectra of some structural quadratics. Observations are made as to the generalised Bent properties of boolean functions of algebraic degree greater than two, and the number of flat spectra w.r.t. {I,H,N}^n are computed for some of them.
Parker Matthew G.
Petrides George
Riera Constanza
No associations
LandOfFree
Generalised Bent Criteria for Boolean Functions (II) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Generalised Bent Criteria for Boolean Functions (II), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalised Bent Criteria for Boolean Functions (II) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-722109