Definability of Boolean function classes by linear equations over GF(2)
Foldes, Stephan; Couceiro, Miguel (2004), Definability of Boolean function classes by linear equations over GF(2), Discrete Applied Mathematics, 142, 1-3, p. 29-34. http://dx.doi.org/10.1016/j.dam.2003.09.002
Type
Article accepté pour publication ou publiéDate
2004Journal name
Discrete Applied MathematicsVolume
142Number
1-3Publisher
Elsevier
Pages
29-34
Publication identifier
Metadata
Show full item recordAbstract (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.Subjects / Keywords
Relational constraints; Linear functions; Equational classes; Clones; Boolean function classesRelated items
Showing items related by title and author.
-
Foldes, Stephan; Couceiro, Miguel (2007) Article accepté pour publication ou publié
-
Lehtonen, Erkko; Foldes, Stephan; Couceiro, Miguel (2006) Article accepté pour publication ou publié
-
Kivelä, Jari; Hella, Lauri; Couceiro, Miguel (2008) Article accepté pour publication ou publié
-
Foldes, Stephan; Lehtonen, Erkko; Couceiro, Miguel (2004) Communication / Conférence
-
Foldes, Stephan; Couceiro, Miguel (2005) Article accepté pour publication ou publié