N-bit parity neural networks with minimum number of threshold neurons

In this paper ordered neural networks for the $N$-bit parity function containing $\mathop{\log }\nolimits_{2} (N+1)$ threshold elements are constructed. The minimality of this network is proved. The connection of minimum perceptrons of Gamb for the $N$-bit parity function wint one combinatorial problems is established.