|
This article is cited in 2 scientific papers (total in 2 papers)
Theoretical Foundations of Applied Discrete Mathematics
On linear decomposition of Boolean functions
A. V. Cheremushkin EMA IS, Moscow, Russia
Abstract:
Disjunctive decompositions of Boolean functions taken after a linear substitution on the set of arguments are considered. For any component of such a decomposition, a notion of a substantial variables subspace is introduced. The main topic of the article is to give some sufficient condition under which the both these subspaces unequally determine each other in a simple disjunctive decomposition of a function having the trivial stabiliser group of shifts. The case of iterative disjunctive decomposition is considered too.
Keywords:
Boolean function, vector space, dual space, simple disjunctive decomposition, iterative disjunctive decomposition.
Citation:
A. V. Cheremushkin, “On linear decomposition of Boolean functions”, Prikl. Diskr. Mat., 2016, no. 1(31), 46–56
Linking options:
https://www.mathnet.ru/eng/pdm534 https://www.mathnet.ru/eng/pdm/y2016/i1/p46
|
Statistics & downloads: |
Abstract page: | 347 | Full-text PDF : | 122 | References: | 66 |
|