Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/universal-affine-classification-of-boolean-functions-JfPTNIUmdS
References (32)
-
D. Slepian (1960)
Some further theory of group codesBell System Technical Journal, 39
-
Robert Lechner (1971)
HARMONIC ANALYSIS OF SWITCHING FUNCTIONS -
James Maiorana (1991)
A classification of the cosets of the Reed-Muller code R(1, 6)Mathematics of Computation, 57
-
I. Ninomiya (1962)
A study of the structures of Boolean functions and its application to the synthesis of switching circutis.Memoirs of the Faculty of Engineering, Nagoya University, 13
-
S. Golomb (1959)
On the classification of Boolean functionsIRE Trans. Inf. Theory, 5
-
E. Berlekamp, L. Welch (1972)
Weight distributions of the cosets of the (32, 6) Reed-Muller codeIEEE Trans. Inf. Theory, 18
-
P. Clote (1989)
Boolean functions, invariance groups and parallel complexity[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
-
M. Harrison (1964)
On the Classification of Boolean Functions by the General Linear and Affine GroupsJournal of The Society for Industrial and Applied Mathematics, 12
-
Emil Post (1942)
The two-valued iterative systems of mathematical logicAnnals of Mathematics Studies
-
I. Ninomiya (1958)
A theory of the coordinate representation of switching functionsMem. Fac. Engng. Nagoya Univ., 10
-
F. Hoffman (1974)
Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory and Computing -
J. Leon (1979)
An Algorithm for Computing the Automorphism Group of a Hadamard MatrixJ. Comb. Theory, Ser. A, 27
-
T. Kasami, Shu Lin, W. Peterson (1966)
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their ApplicationInf. Control., 11
-
J. S. Leon (1982)
Computing automorphisms of error-correcting codesIEEE Trans. Inform. Theory, 28
-
R. J. Lechner (1967)
A correspondence between equivalence classes of functions and group codesIEEE Trans. Electron. Comput., 16
-
M. Harrison (1971)
COUNTING THEOREMS AND THEIR APPLICATIONS TO CLASSIFICATION OF SWITCHING FUNCTIONS -
T. Berger, P. Charpin (1993)
The automorphism group of Generalized Reed-Muller codesDiscret. Math., 117
-
I. E. Strazdin' (1975)
Affine classification of Boolean functions of five variablesAutomat. Control Comput. Sci., 9
-
I. Strazdins (1995)
Discrete Mathematics and Applications -
I. Strazdins (1981)
Coll. Math. Soc. J. Bolyai -
F. Hoffman, L. Welch (1968)
Totally Variant Sets in Finite Groups and Vector SpacesCanadian Journal of Mathematics, 20
-
P. Delsarte (1970)
On cyclic codes that are invariant under the general linear groupIEEE Trans. Inf. Theory, 16
-
E. I. Nechiporuk (1958)
On the synthesis of networks using linear transformations of argument variablesDokl. Akad. Nauk SSSR, 123
-
F. Hoffman (1976)
Orbits under actions of affine groups over GF (2)Linear Algebra and its Applications, 13
-
H. Stone, Charles Jackson (1969)
Structures of the Affine Families of Switching FunctionsIEEE Transactions on Computers, C-18
-
D. Houghton (1952)
Synthesis of electronic computing and control circuits: Vol. 27 of The Annals of the Computation Laboratory of Harvard University, 278 pages, diagrams, 20 × 27 cm. Cambridge, Harvard University Press, 1951. Price, $8.00Journal of The Franklin Institute-engineering and Applied Mathematics, 253
-
Robert Lechner (1970)
A Transform Approach to Logic DesignIEEE Transactions on Computers, C-19
-
Robert Lechner (1967)
A Correspondence Between Equivalence Classes of Switching Functions and Group CodesIEEE Trans. Electron. Comput., 16
-
R. J. Lechner (1971)
Recent Developments in Switching Theory -
H. Aiken (1951)
Synthesis of Electronic Computing and Control Circuits -
J. Leon (1982)
Computing automorphism groups of error-correcting codesIEEE Trans. Inf. Theory, 28
-
W. Robbins, L. Rudolph (1974)
On Two-Level Exclusive-or Majority NetworksIEEE Transactions on Computers, C-23
- Publisher
- Springer Journals
- Copyright
- Copyright © 1997 by Kluwer Academic Publishers
- Subject
- Mathematics; Mathematics, general; Computer Science, general; Theoretical, Mathematical and Computational Physics; Complex Systems; Classical Mechanics
- ISSN
- 0167-8019
- eISSN
- 1572-9036
- DOI
- 10.1023/A:1005769927571
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we advance a practical solution of the classification problem of Boolean functions by the affine group – the largest group of linear transformations of variables. We show that the affine types (equivalence classes) can be arranged in a unique infinite sequence which contains all previous lists of types. The types are specified by their minimal representatives, spectral invariants, and stabilizer orders. A brief survey of the fundamental transformation groups is included.
Journal
Acta Applicandae Mathematicae – Springer Journals
Published: Oct 15, 2004