Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Lempel–Ziv–Welch

Known as: Lempel-Ziv-Welch algorithm, ZLW, Lzw 
Lempel–Ziv–Welch (LZW) is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by… Expand
Wikipedia

Related topics

Related topics

30 relations
AlgorithmArithmetic codingBinary-to-text encodingConcatenation
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Boosted MMI for model and feature-space discriminative training
We present a modified form of the maximum mutual information (MMI) objective function which gives improved results for… Expand
  • table 1
  • table 3
  • table 4
  • table 2
  • table 5
Highly Cited
2008
Highly Cited
2008
Correlation Noise Modeling for Efficient Pixel and Transform Domain Wyner–Ziv Video Coding
In recent years, practical Wyner-Ziv (WZ) video coding solutions have been proposed with promising results. Most of the solutions… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Highly Cited
2006
Highly Cited
2006
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Highly Cited
2005
Highly Cited
2005
Achieving the Welch bound with difference sets
Consider a codebook containing N unit-norm complex vectors in a K-dimensional space. In a number of applications, the codebook… Expand
  • table I
  • figure 1
  • table II
  • figure 2
  • figure 3
Highly Cited
2005
Highly Cited
2005
Image compression and entanglement
The pixel values of an image can be casted into a real ket of a Hilbert space using an appropriate block structured addressing… Expand
  • figure 1
  • figure 2
Highly Cited
2004
Highly Cited
2004
On Prediction Using Variable Order Markov Models
This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
Large-Scale Fabrication of Ordered Nanobowl Arrays
A novel approach is presented for the large-scale fabrication of ordered TiO2 nanobowl arrays. The process starts with a self… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to… Expand
  • figure 1
  • table 1
  • table 2
  • table 4
1997
1997
Redundancy of the Lempel-Ziv-Welch code
  • S. Savari
  • Proceedings DCC '97. Data Compression Conference
  • 1997
    • Corpus ID: 33397823
The Lempel-Ziv codes are universal variable-to-fixed length codes that have become virtually standard in practical lossless data… Expand
Highly Cited
1997
Highly Cited
1997
Redundancy of the Lempel-Ziv incremental parsing rule
  • S. Savari
  • IEEE Trans. Inf. Theory
  • 1997
    • Corpus ID: 17340208
The Lempel-Ziv codes are universal variable-to-fixed length codes that have become virtually standard in practical lossless data… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE