Preparable ensembles for remote state preparation

We determine all the ensembles that can be remotely prepared in a deterministic and oblivious way using a nonmaximally entangled resource with minimum classical communication cost when Bob's unitary transformations form a cyclic group. We show that the classical communication has maximal informational entropy. We also give a constraint for the shared entangled resource that can be used for remote state preparation.