Referenced Items are not available for this document.
We study an ill-posed linear inverse problem, where a binary sequence will be reproduced using a sparse matrix of LDPC type. We propose an iterative algorithm based on belief propagation technique. Numerical results show that the algorithm can empirically saturate the theoretical limit for the sparse construction of our codes, which also is very close to the rate-distortion function itself.
Published in:
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Date of Conference: 27 June-2 July 2004
- Print ISBN:
- 0-7803-8280-3
- INSPEC Accession Number:
- 8188682
- Digital Object Identifier :
- 10.1109/ISIT.2004.1365335
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
