Back to search

NJIT

Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm

Abstract

dc:description.abstract

<p>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 string 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.</p><p>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 resourses.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer and Information Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mehta, Ashish Khandubhai
Contributors dc:contributor
  • Yehoshua Perl

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2851

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Mehta, Ashish Khandubhai. Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm. https://digitalcommons.njit.edu/theses/2851