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.