A Property of Hadamard Matrices

Binary codes obtained from Hadamard matrices of order $m=q+1$, where $q$ is a power of an odd prime, are investigated in connection with the problem of encoding the states of an asynchronous finite automaton to enhance its structural reliability. An estimate is obtained for the corrective power of the matrices in the given class when races are present in the memory elements. It is shown that the lower bound for the corrective power is reached.