๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction and counting or generalized Boolean functions

โœ Scribed by Yongcai Liu

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
303 KB
Volume
69
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Suppose that G llowing corkditions:

e denote &a, x) = g(b, x). (hb) b 4 G&s) = {O,l}cAcB k=2 IAl=& and F,,(g) be the set of all n variables Generalized oolean Functions e For Q oolean algebra I=m=2', we/me ~C(B)l = x3 ("; 2)(k + 2)f(m-2). k=O en nit is su#icienlly large, we have

๐Ÿ“œ SIMILAR VOLUMES

Symmetry Groups of Boolean Functions and
Symmetry Groups of Boolean Functions and Constructions of Permutation Groups
โœ Andrzej Kisielewicz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 273 KB

In this paper we deal with the symmetry group S f of a boolean function f on n-variables, that is, the set of all permutations on n elements which leave f invariant. The main problem is that of concrete representation: which permutation ลฝ . groups on n elements can be represented as G s S f for some

Next Generation SDH/SONET (Evolution or
Next Generation SDH/SONET (Evolution or Revolution?) || Functional Models for LCAS and GFP
โœ van Helvoort, Huub ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley & Sons, Ltd ๐ŸŒ English โš– 222 KB

Since the turn of the twentieth century, telecommunications has shifted from traditional voice transport to data transport, although digitized voice is still a large contributor. Instead of an evolution of existing transport standards, a revolution was necessary in order to enable additional data-re