Complexity of realization of a linear Boolean function in Sheffer's basis

The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis $\left\{\overline{x \& y}\right\}$. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuts realizing a linear function.