Lempel–Ziv–Storer–Szymanski

Known as: LZSS, Lempel-Ziv-Storer-Szymanski 
Lempel–Ziv–Storer–Szymanski (LZSS) is a lossless data compression algorithm, a derivative of LZ77, that was created in 1982 by James Storer and… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2018
024619932018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, we propose a FPGA bitstream compression method based on LZ77 algorithm and Bitmask-based Compression(BMC… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We present a new, simple, and efficient approach for computing the Lempel-Ziv (LZ77) factorization of a string in linear time… (More)
  • table 1
  • table 2
Is this relevant?
2009
2009
The well-known dictionary-based algorithms of the Lempel-Ziv (LZ) 77 family are the basis of several universal lossless… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2004
2004
In this correspondence, we present a new universal entropy estimator for stationary ergodic sources, prove almost sure… (More)
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
2003
2003
We introduce a general framework which is suitable to capture the essence of compressed pattern matching according to various… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
High speed and low cost configuration loading methods for a coarse grain multicontext reconfigurable device DRP(Dynamically… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2001
2001
We explore the possibility of using multiple processors to improve the encoding and decoding times of Lempel–Ziv schemes. A new… (More)
Is this relevant?
2001
2001
In the implementation of lossless compression, the traditional Lempel-Ziv dictionary algorithm produces good compression… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2001
2001
For a Markovian source, we analyze the Lempel—Ziv parsing scheme that partitions sequences into phrases such that a new phrase is… (More)
Is this relevant?
1999
1999
We introduce a general framework which is suitable to capture an essence of compressed pattern matching according to various… (More)
  • figure 1
Is this relevant?