In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way model, our bound extends the well known upper bound of Kremer, Nisan and Ron [KNR95] to include non-product distributions. Let (0, 1/2) be a constant. We show that for a boolean function f : X