A set of quasi-uniform random variables X1,…,Xn may be generated from a finite group G and n of its subgroups, with the corresponding entropic vector depending on the subgroup structure of G. It is known that the set of entropic vectors obtained by considering arbitrary finite groups is much richer than the one provided just by abelian groups. In this paper, we start to investigate in more detail different families of non-abelian groups with respect to the entropic vectors they yield. In particular, we address the question of whether a given non-abelian group G and some fixed subgroups G1,…,Gn end up giving the same entropic vector as some abelian group A with subgroups A1,…,An, in which case we say that (A,A1,…,An) represents (G,G1,…,Gn). If for any choice of subgroups G1,…,Gn, there exists some abelian group A which represents G, we refer to G as being abelian (group) representable for n. We completely characterize dihedral, quasi-dihedral and dicyclic groups with respect to their abelian representability, as well as the case when n=2, for which we show a group is abelian representable if and only if it is nilpotent. This problem is motivated by understanding non-linear coding strategies for network coding, and network information theory capacity regions.