Lempel-Ziv-Storer-Szymanski (LZSS) is a lossless data compression algorithm, a derivative of LZ77, that was created in 1982 by James Storer and Thomas Szymanski. LZSS was described in article "Data compression via textual substitution" published in Journal of the ACM (pp. 928-951).

Lempel-Ziv-Storer-Szymanski (LZSS) 是一种无损压缩算法，是对LZ77算法的派生，由James Storer和Thomas Szymanski在1982年提出。描述LZSS算法的文章：《利用原文替换的数据压缩》发表在ACM杂志上(pp. 928-951)。

LZSS is a dictionary encoding technique. It attempts to replace a string of symbols with a reference to a dictionary location of the same string.

LZSS算法是一种字典编码技术。它尝试用同样的字符串在字典中的位置符号来替换原字符串。

The main difference between LZ77 and LZSS is that in LZ77 the dictionary reference could actually be longer than the string it was replacing. In LZSS, such references are omitted if the length is less than the "break even" point. Furthermore, LZSS uses one-bit flags to indicate whether the next chunk of data is a literal (byte) or a reference to an offset/length pair.

LZ77算法和LZSS算法之间的主要差异在于，与LZ77算法相比LZSS算法事实上可以做到替换更长的字符串。在LZSS算法中，如果替换长度达不到“断文”点，这样的替换将被忽略。另外，LZSS算法使用一个二进制位标识下一个数据片是一个原文（字节）还是一个偏移／长度对。