# Equivalence Classes of Boolean Functions for

##### Citations

4 citations

### Cites background or methods from "Equivalence Classes of Boolean Func..."

...This paper is a continuation of the work related to classification of logic functions by decision diagrams [19] and representation and construction of bent functions (binary and multiple-valued) by decision diagrams [20], [21]....

[...]

...These operations partition the set of binary functions of a given number of variables into equivalence classes with identical Walsh spectra under the change of the sign and permutation of precisely defined subsets of Walsh coefficients [14], [19]....

[...]

...For example, BDDs and Walsh decision diagrams (WDDs) are used for the classification of switching functions [19], [24]....

[...]

### Cites background or methods from "Equivalence Classes of Boolean Func..."

...See discussions about representing representative functions in the NPN - classification by BDDs and Functional decision diagrams (FDDs) in [13] and LP -representatives by Walsh decision diagrams (WDDs) in [10]....

[...]

...See discussions about representing representative functions in the NPN classification by BDDs and Functional decision diagrams (FDDs) in [13] and LP -representatives by Walsh decision diagrams (WDDs) in [10]....

[...]

...This leads to the classification of switching functions in terms of the shape of WDDs [10]....

[...]

...In [10], it is shown that different LP -representative functions can be represented by the Walsh decision diagrams (WDDs) of the same shape....

[...]

##### References

8,777 citations

3,616 citations

2,269 citations

943 citations

764 citations