Recursive Algorithm to Verify Quasi-Uniform Entropy Vectors and its Applications

It is of central interest in information theory to determine whether a given vector in the entropy space is an almost entropic vector. This problem can be answered if all the information inequalities are known, but this is an extremely challenging problem. On the other hand, we can establish that a given vector is an entropy vector if we can show the existence of distribution such that the corresponding entropy vector is the same as the given vector. However, there is no known algorithm to solve this problem. Only for the simplest case of binary entropy vectors, an algorithm is known to solve this problem. In this paper, we present a recursive algorithm to determine whether a given vector is a quasi-uniform entropy vector and, if it is, to return a consistent quasi-uniform distribution. We also present two applications of the recursive procedure: (i) to generate all quasi-uniform distributions motivated by the problem of finding the smallest quasi-uniform distribution such that its entropy vector violates the well known Ingleton inequality and (ii) to obtain an entropy vector (not necessarily quasi-uniform) near to a target vector in the entropy space for random variables with given alphabet size.