Title :
On L×n Boolean matrices with all L×k submatrices having 2k distinct row vectors
Author_Institution :
Dept. of Comput. Sci., Univ. of Saarlands, Saarbrucken, Germany
Abstract :
The author describes a new method to construct an L×n boolean matrix for two given integers n and k (k<n), such that every L ×k submatrix contains 2k distinct row vectors of {1,0}k. The magnitude of L is O((log n)2logk). This method has considerable advantage for small k and practical n. It can be applied to test generation of VLSI circuits, design of threshold circuits and fault tolerant systems, and other fields
Keywords :
Boolean algebra; matrix algebra; Boolean matrices; VLSI circuits; fault tolerant systems; partition algorithm; submatrices; test generation; threshold circuits; Concrete; Partitioning algorithms; Testing;
Conference_Titel :
Design Automation. EDAC., Proceedings of the European Conference on
Conference_Location :
Amsterdam
DOI :
10.1109/EDAC.1991.206463
