Complexity of a system of linear Boolean function

The complexity of computing systems of linear Boolean functions by circuits in the linear basis $\{\oplus \}$ is considered. A tight value of the complexity of the system of linear Boolean functions with a coefficient matrix coinciding with a Hadamard matrix is established.