Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Muramatsu, J. ; NTT Commun. Sci. Labs., NTT Corp., Kyoto ; Miyake, S.

The aim of this paper is to prove the achievability of the Wyner-Ziv source coding problem by using sparse matrices and maximal-likelihood (ML) coding. To this end, the notion of a hash property for an ensemble of functions is introduced. For example, an ensemble of q-ary sparse matrices satisfies the hash property. Based on this property, it is proved that the rate of codes using sparse matrices and maximal-likelihood (ML) coding can achieve the optimal rate.

Published in:

Information Theory, 2008. ISIT 2008. IEEE International Symposium on

Date of Conference:

6-11 July 2008