Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm

Document Type

Conference Proceeding

Publication Date

1-1-1991

Abstract

Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length strings over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings. To obtain a variable to variable length coding we choose to cascade the LZW, variable to fixed, coding with the Huffman, fixed to variable, coding. In this work we consider the effective way of performing this cascading, to optimize the compression using limited time resources.

Identifier

84901948688 (Scopus)

ISBN

[9780387976280]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/BFb0038489

e-ISSN

16113349

ISSN

03029743

First Page

170

Last Page

178

Volume

507 LNCS

This document is currently not available here.

Share

COinS