Improving index coding efficiency of Lempel-Ziv-Welch algorithm by dictionary quasi-filling

Improving index coding efficiency of Lempel-Ziv-Welch algorithm by dictionary quasi-filling

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A new approach is proposed to improve the index coding efficiency of LZW. The proposed method does not reduce the code bit length, but instead enlarges the size of the practical dictionary for string matching. To achieve this, a modified dictionary adaptation method called dictionary quasi-filling is used. Experiments show that the proposed method outperforms arithmetic coding for the majority of relatively short test sequences, as well as on all very long sequences.


    1. 1)
      • T.A. Welch . A technique for high-performance data compression. IEEE Comput. , 8 - 19
    2. 2)
      • T.C. Bell , J.G. Cleary , I.H. Witten . (1990) Text compression.
    3. 3)
      • J. Ziv , A. Lempel . Compression of individual sequence via variable-rate coding. IEEE Trans. Inf. Theory , 5 , 530 - 536
    4. 4)
      • Horspool, R.N.: `Improving LZW', Proc. Data Compression Conf. (DCC '91), IEEE Computer Society Press.
    5. 5)
      • I.H. Witten , R. Neal , J.G. Cleary . Arithmetic coding for data compression. Comm. ACM , 6 , 520 - 540
    6. 6)
      • Kim, T.Y.: `Two new approaches to improve LZW data compression', 1998, M.S., Seoul National University.

Related content

This is a required field
Please enter a valid email address