find all possible subsets satisfying a predicate

Question

I have a set S of N elements. Each element is represented by a string of bits of length L. For example, with L=5, S could be formed by { 01010, 01100, 10100, 00001 }