Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms (Q1395277): Difference between revisions

In this paper the author obtains irredundant disjunctive normal forms (DNFs) for Boolean functions defined by a matrix of zeros of order \(k\times{n}\), \(k\geq 4\), that contains an identity submatrix (disregarding the duality and permutation of columns) of order \(k\times{k}\). Special attention is paid to the construction of irredundant DNFs for full Boolean functions.