On some characteristics of Boolean functions without prohibition of four variables in connection with the construction of bijective mappings of a special type

Download article in PDF format

Authors: Rozhkov M. I.

Annotation: In the work we consider the algorithms of lowering pairs finding for functions without prohibition of four variables. Lowering (or restrictive) pairs of natural numbers (h, t), h > t for functions without prohibition was studied earlier by the author in connection with the construction of bijective mappings B f , L defined by the shift register of length n with feedback function L , essentially dependent on a limited number of initial and final arguments, and a nonlinear function of removal of k arguments (k << n).

Keywords: orthogonal system of boolean functions, feedback shift register, filter generator, restrictive multitude