By Topic

A lossy data compression based on an approximate pattern matching

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)
Luczak, T. ; Math. Inst., Polish Acad. of Sci., Poznan, Poland ; Szpankowski, W.

A practical suboptimal (variable source coding) algorithm for lossy data compression is presented. This scheme is based on an approximate string matching, and it extends lossless Wyner-Ziv data compression scheme

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995