Title :
Lossy Data Compression over Zq by LDPC Code
Author_Institution :
Lab. of Network Innovation, NTT, Tokyo
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
Keywords :
binary codes; data compression; matrix algebra; parity check codes; LDPC code; binary alphabet; lossy data compression; parity check matrix; rate-distortion limit; Channel coding; Data compression; Decoding; Laboratories; Parity check codes; Probability distribution; Rate-distortion; Source coding; Technological innovation; Vector quantization;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261726
