|
|
A001289
|
|
Number of equivalence classes of Boolean functions modulo linear functions.
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of equivalence classes of all 2^(2^n) maps from GF(2)^n to GF(2), where maps f and g are equivalent iff there exists an invertible n X n binary matrix M, two n-dimensional binary vectors a and b and a binary scalar c such that g(x) = f(Mx+a) + b.x + c.
|
|
REFERENCES
|
R. J. Lechner, Harmonic Analysis of Switching Functions, in A. Mukhopadhyay, ed., Recent Developments in Switching Theory, Acad. Press, 1971, pp. 121-254, esp. p. 186.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1977, p. 431.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(7) from Hou (1995)
|
|
STATUS
|
approved
|
|
|
|