Organization of chains in a \(n\)-dimensional cube by methods of coding theory. (Russian) Zbl 0668.94019
A parametric algorithm is presented to find the minimal lower one-element of monotonous Boolean functions. The algorithm is described in detail and problems arising in the algorithm’s construction are solved, namely the organization of chains in an n-dimensional cube. Methods of coding theory as Reed-Muller codes and cyclic codes are applied.
MSC:
94C10 | Switching theory, application of Boolean algebra; Boolean functions (MSC2010) |
94B05 | Linear codes (general theory) |
94B15 | Cyclic codes |