Inversion complexity of self-correcting circuits for a certain sequence of boolean functions

The asymptotics L _k ^? (f ₂ ⁿ ) ?? n min{k+1, p} is obtained for the sequence of Boolean functions $f_2^n \left( {x_1 , \ldots ,x_n } \right) = \mathop \vee \limits_{1 \leqslant i < j \leqslant n}$ for any fixed k, p ?? 1 and growing n, here L _k ^? (f ₂ ⁿ ) is the inversion complexity of realization of the function f ₂ ⁿ by k-self-correcting circuits of functional elements in the basis B = {&, ?}, p is the weight of a reliable invertor.