Lempel-Ziv-Oberhumer, usually abbreviated LZO, is a lossless data compression algorithm focused on decompression speed. The original lzop implementation, released in 1996, was developed by Markus Franz Xaver Johannes Oberhumer, based on earlier algorithms by Abraham Lempel and Jacob Ziv. The LZO library implements several algorithms that share these properties: higher compression speed than DEFLATE, very fast decompression, a small extra buffer of 8 kB or 64 kB during compression, no additional memory for decompression beyond the source and destination buffers, and an adjustable balance between compression ratio and compression speed that does not affect decompression speed. As a block compression algorithm it compresses blocks of data into matches against a sliding dictionary and runs of literal bytes, and it expands incompressible data by at most 1/64 of its original size over blocks of at least 1 kB. The reference implementation is written in ANSI C under the GNU General Public License, and the Linux kernel uses LZO in btrfs, initramfs, SquashFS, zram and zswap.
Connections
Credited To
Source Lempel-Ziv-Oberhumer (Wikipedia)
Source Lempel-Ziv-Oberhumer (Wikipedia)
In Field
Source Lempel-Ziv-Oberhumer (Wikipedia)
Invented
Source Lempel-Ziv-Oberhumer (Wikipedia)
Sources
Lempel-Ziv-Oberhumer (Wikipedia)
In Group: Data Compression Algorithms, Lead
(LZO) is a lossless data compression algorithm that is focused on decompression speed.
In Field: Algorithms and Complexity Theory, Lead
(LZO) is a lossless data compression algorithm that is focused on decompression speed.
Credited To: Abraham Lempel, Lead [credited-to]
based on earlier algorithms by Abraham Lempel and Jacob Ziv.
Credited To: Jacob Ziv, Lead [credited-to]
based on earlier algorithms by Abraham Lempel and Jacob Ziv.
Invented: Markus F. X. J. Oberhumer, Design
was developed by Markus Franz Xaver Johannes Oberhumer
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.