Abstract
In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.
Acknowledgements
The authors wish to thank the referees for their comments and suggestions that contributed to an improvement of the presentation of this article. This research was financially supported by PENED 03ED 740 of the Greek General Secretariat for Research and Technology.