Lossy Data Compression over Zq by LDPC Code

Abstract

For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix