Definability of Boolean function classes by linear equations over GF(2)

Thumbnail
Date
2004
Dewey
Principes généraux des mathématiques
Sujet
Relational constraints; Linear functions; Equational classes; Clones; Boolean function classes
Journal issue
Discrete Applied Mathematics
Volume
142
Number
1-3
Publication date
2004
Article pages
29-34
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.dam.2003.09.002
URI
https://basepub.dauphine.fr/handle/123456789/10170
Collections
Metadata
Show full item record
Author
Foldes, Stephan
Couceiro, Miguel
Type
Article accepté pour publication ou publié
Abstract (EN)
Necessary and sufficient conditions are provided for a class of Boolean functions to be definable by a set of linear functional equations over the two-element field. The conditions are given both in terms of closure with respect to certain functional compositions and in terms of definability by relational constraints.