— A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum -achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verd´u.