Thumbnail
Access Restriction
Subscribed

Author Apostolico, A. ♦ Yong Wook Choi
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2006
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Data compression ♦ Testing ♦ Algorithm design and analysis ♦ USA Councils ♦ Solids ♦ Autocorrelation ♦ Character generation ♦ Encoding ♦ Linearity ♦ Computational complexity
Abstract Summary form only given. In this paper, various lossless and lossy adaptations and extensions of that paradigm are developed and tested, for the most part susceptible to simple linear time implementation. This is in contrast to the existing lossy variants of the Ziv-Lempel family of encoders, which have been traditionally built around the iterated quest for the best match within an assigned fidelity, thereby resulting in algorithms that are inherently superlinear and not easy to implement and analyze. Whereas a thorough analytical treatment of the proposed method seems hard, the basic algorithm and its main variants show good performance and latitude of practical applicability
Description Author affiliation: Dipt. di Ingegneria dell'Informazione, Padova Univ. (Apostolico, A.)
ISBN 0769525458
ISSN 10680314
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2006-03-28
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 90.16 kB
Page Count 437
Starting Page 1
Ending Page 437


Source: IEEE Xplore Digital Library