Construction of Universal Codes Using LDPC Matrices and Their Error Exponents
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Construction of Lossy Source Code Using LDPC Matrices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Application of Linear Codes to the Problem of Source Coding with Partial Side Information
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Suboptimality of Linear Lossy Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Nonlinear sparse-graph codes for lossy compression
IEEE Transactions on Information Theory
Variable length lossy coding using an LDPC code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Efficient LDPC codes over GF(q) for Lossy data compression
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Polar codes are optimal for lossy source coding
IEEE Transactions on Information Theory
Hash property and coding theorems for sparse matrices and maximum-likelihood coding
IEEE Transactions on Information Theory
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
| Hi-index | 755.14 |
In this article, low-density parity-check (LDPC) codes are applied to lossy source coding and we study how the asymptotic performance of MacKay's (see ibid, vol.45, p.399-431, Mar. 1999 and vol.47, p.2101, July, 2001) LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary independent and identically distributed (i.i.d.) source with Pr{x=1}=0.5. In the sequel, it is shown that an LDPC code with column weight O(logn) for code length n can attain the rate-distortion function asymptotically.