Synthesis of reliable circuits in the basis consisting of the Webb function in $P_k$

We consider the realization of $k$-meaning logics $(k > 3)$ functions by the circuits from unreliable gates in the complete basis, consisting of the Webb function. We assume that the basic gates pass into faulty states independently of each other and the faults are such that each of the incorrect values appears at the output of the basis gate with the same probability.
Previously we developed methods for the synthesis of reliable circuits for $k \in \{3, 4, 5\}$. In this article we show that for $ k \ge 6$ any $k$-meaning logic functions can be realized by an reliable circuit, we offer two methods of the synthesis of reliable circuits and we make a comparison of the upper bounds for unreliability of constructed circuits, which are obtained with the help of these methods.
The obtained results are valid in the dual (with respect to the permutation generated by the Lukashevich function) basis for the same faults.