Identification of Disjoint Bi-decompositions in Boolean Functions through Walsh Spectrum

ISSN： 1065-514X

Source： VLSI Design, Vol.14, Iss.3, 2002-01, pp. : 307-313

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cryptographically significant Boolean functions with five valued Walsh spectra

By Maitra S. Sarkar P.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 133-146

Elsevier

Access to resources Recommend Favorite

On the computability of Walsh functions

By Mori T.

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 419-436

Elsevier

Access to resources Recommend Favorite

Multiplicative Properties of Spectral Walsh Coefficients of the Boolean Function

By Yanushkevich C. N.

Automation and Remote Control, Vol. 64, Iss. 12, 2003-12 ,pp. : 1938-1947

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Exploiting Functional Properties of Boolean Functions for Optimal Multi-Level Design by Bi-Decomposition

By Steinbach Bernd

Artificial Intelligence Review, Vol. 20, Iss. 3-4, 2003-12 ,pp. : 319-360

Springer Publishing Company

Access to resources Recommend Favorite

Tree-shellability of Boolean functions

By Takenaga Y. Nakajima K. Yajima S.

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 633-647

Elsevier

Access to resources Recommend Favorite