LZSS

From Just Solve the File Format Problem
(Difference between revisions)
Jump to: navigation, search
 
(2 intermediate revisions by one user not shown)
Line 3: Line 3:
 
|subcat=Compression
 
|subcat=Compression
 
}}
 
}}
The '''LZSS''' format is a data compression format which improves on the [[LZ77]] compression format. The compression works by pointing an end point and a final point in a dictionary back to the original data.  
+
'''LZSS''' is (1) a [[LZSS (Haruhiko Okumura)|piece of computer software]] by Haruhiko Okumura, and (2) a vaguely-defined family of data compression algorithms and formats related to Okumura's LZSS, [[LZ77]], and a certain subset of the methods discussed in Storer and Szymanski's 1982 paper ''Data Compression via Textual Substitution''.
  
==Sources==
+
LZSS can perhaps be defined so broadly as to include all LZ77-like formats that remove the original LZ77's requirement that "match" and "character" codes must alternate. However, it is usually defined at least a little more narrowly, in particular to disallow matches that are deemed too short to be beneficial.
 +
 
 +
The name LZSS is almost certainly derived from ''Lempel–Ziv–Storer–Szymanski''.
 +
 
 +
== See also ==
 +
* [[LZSS (Haruhiko Okumura)]]
 +
* [[LZ77]]
 +
 
 +
== Links ==
 +
* [https://dl.acm.org/doi/10.1145/322344.322346 Data compression via textual substitution] - The Storer & Szymanski paper
 +
* [[Wikipedia: Lempel–Ziv–Storer–Szymanski]]
 +
* [https://web.archive.org/web/20140312111520/http://www.binaryessence.com/dct/en000139.htm Binary Essence: LZSS] (archived)
 
* [http://sci-hub.bz/cac20b069095b8311e469d5250c6e266/ozsoy2011.pdf CULZSS: LZSS Lossless Data Compression on CUDA paper by Adnan Ozsoy & Martin Swany]
 
* [http://sci-hub.bz/cac20b069095b8311e469d5250c6e266/ozsoy2011.pdf CULZSS: LZSS Lossless Data Compression on CUDA paper by Adnan Ozsoy & Martin Swany]
* [http://www.binaryessence.com/dct/en000139.htm Binary Essence]
 

Latest revision as of 18:11, 10 May 2022

File Format
Name LZSS
Ontology

LZSS is (1) a piece of computer software by Haruhiko Okumura, and (2) a vaguely-defined family of data compression algorithms and formats related to Okumura's LZSS, LZ77, and a certain subset of the methods discussed in Storer and Szymanski's 1982 paper Data Compression via Textual Substitution.

LZSS can perhaps be defined so broadly as to include all LZ77-like formats that remove the original LZ77's requirement that "match" and "character" codes must alternate. However, it is usually defined at least a little more narrowly, in particular to disallow matches that are deemed too short to be beneficial.

The name LZSS is almost certainly derived from Lempel–Ziv–Storer–Szymanski.

[edit] See also

[edit] Links

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox