A recursive construction of the set of binary entropy vectors

The primary contribution is a finite terminating algorithm that determines membership of a candidate entropy vector in the set of binary entropy vectors ¿_N. We outline the relationship between ¿_N and its unbounded cardinality discrete random variable counterpart ¿¿_N*or its normalization ¿¿_N*). We discuss connections between ¿_N and ¿¿_N*. For example, for any outer bound, say the Shannon outer bound P_N, to ¿¿_N*, we provide a finite terminating algorithm to find a polytopic inner bound on ¿¿_N* that agrees on tight faces of the outer bound.