On sets of Boolean n-vectors with all k-projections surjective
- 38 Downloads
Given a set, S, of Boolean n-vectors, one can choose k of the n coordinate positions and consider the set of k-vectors which results by keeping only the designated k positions of each vector, i.e., from k-projecting S. In this paper, we study the question of finding sets S as small as possible such that every k-projection of S yields all the 2 k possible k-vectors. We solve this problem constructively and almost optimally for k=2 and all n. For k≧3, the constructive solutions we describe are much larger than an O(k 2 k log n) nonconstructive upper bound which we derive. The nonconstructive approach allows us to generate fairly small sets S which have a very high probability of having the surjective k-projection property.
KeywordsInformation System Operating System Data Structure High Probability Communication Network
Unable to display preview. Download preview PDF.
- 1.Birkhoff, G.: Lattice Theory. Am. Math. Soc., Providence, Rhode Island, 1967Google Scholar
- 2.Chandra, A.K., Kou, L.T., Markowsky, G., Zaks, S.: On sets of Boolean n-vectors with all k-projections surjective. Technical report RC 8936, IBM Research, Yorktown Heights, July 1981Google Scholar
- 3.Tang, D.T., Woo, L.S.: Exhaustive test pattern generation with constant weight vectors. Technical report RC 9442, IBM Research, Yorktown Heights, June 1982Google Scholar
- 4.Tang, D.T., Chen, C.L.: Personal communication, Aug. 1982Google Scholar
- 5.Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6, 255–262 (1973)Google Scholar