Epstein Files Full PDF

CLICK HERE
Technopedia Center
PMB University Brochure
Faculty of Engineering and Computer Science
S1 Informatics S1 Information Systems S1 Information Technology S1 Computer Engineering S1 Electrical Engineering S1 Civil Engineering

faculty of Economics and Business
S1 Management S1 Accountancy

Faculty of Letters and Educational Sciences
S1 English literature S1 English language education S1 Mathematics education S1 Sports Education
teknopedia

  • Registerasi
  • Brosur UTI
  • Kip Scholarship Information
  • Performance
Flag Counter
  1. World Encyclopedia
  2. LZ4 (compression algorithm) - Wikipedia
LZ4 (compression algorithm) - Wikipedia
From Wikipedia, the free encyclopedia
Lossless compression algorithm

LZ4
Original authorYann Collet
DeveloperYann Collet
Initial release24 April 2011 (2011-04-24)
Stable release
1.10.0[1] Edit this on Wikidata / 22 July 2024; 19 months ago (22 July 2024)
Written inC
Operating systemCross-platform
PlatformPortable
TypeData compression
LicenseSimplified BSD License
Websitelz4.org Edit this at Wikidata
Repository
  • github.com/lz4/lz4 Edit this at Wikidata
LZ4 Frame Format
Magic number04 22 4D 18 (new)
02 21 4C 18 (legacy)[2]
Type of formatData compression
Websitehttps://github.com/lz4/lz4/blob/master/doc/lz4_Frame_format.md

LZ4 is a lossless data compression algorithm optimized for fast compression and decompression. It belongs to the LZ77 family of byte-oriented compression schemes.

Features

[edit]

The LZ4 algorithm provides a good trade-off between speed and compression ratio. Typically, it has a smaller (i.e., worse) compression ratio than the similar LZO algorithm, which in turn is worse than algorithms like DEFLATE. However, LZ4 compression speed is similar to LZO and several times faster than DEFLATE, while decompression speed is significantly faster than LZO.[3]

Design

[edit]

LZ4 only uses a dictionary-matching stage (LZ77) and, unlike other common compression algorithms, does not combine it with an entropy coding stage (e.g. Huffman coding in DEFLATE).[4][5]

The LZ4 algorithm represents the data as a series of sequences. Each sequence begins with a one-byte token that is broken into two 4-bit fields. The first field represents the number of literal bytes that are to be copied to the output. The second field represents the number of bytes to copy from the already decoded output buffer (with 0 representing the minimum match length of 4 bytes). A value of 15 in either of the bitfields indicates that the length is larger and there is an extra byte of data that is to be added to the length. A value of 255 in these extra bytes indicates that yet another byte is to be added. Hence, arbitrary lengths are represented by a series of extra bytes containing the value 255. The string of literals comes after the token and any extra bytes needed to indicate string length. This is followed by an offset that indicates how far back in the output buffer to begin copying. The extra bytes (if any) of the match-length come at the end of the sequence.[6][7]

Compression can be carried out in a stream or in blocks. Higher compression ratios can be achieved by investing more effort in finding the best matches. This results in both a smaller output and faster decompression.

LZ4 has two frame formats. The legacy format was very restrictive and relied on an external end-of-file signal, which proved to be a problem in Linux initramfs requiring a workaround to handle zero-padding.[8] The new format is a lot more flexible and has its own end-of-frame marker. It resembles the Zstd frame format in design.[9]

Implementation

[edit]

The reference implementation in C by Yann Collet is licensed under a BSD license. There are ports and bindings in various languages including Java, C#, Rust, and Python.[10] The Apache Hadoop system uses this algorithm for fast compression. LZ4 was also implemented natively in the Linux kernel 3.11.[11] The FreeBSD, Illumos, ZFS on Linux, and ZFS-OSX implementations of the ZFS filesystem support the LZ4 algorithm for on-the-fly compression.[12][13][14][15] Linux supports LZ4 for SquashFS since 3.19-rc1.[16] LZ4 is also supported by the newer zstd command line utility by Yann Collet, as well as a 7-Zip fork called 7-Zip-zstd.[17]

References

[edit]
  1. ^ "LZ4 v1.10.0 - Multicores edition". 22 July 2024. Retrieved 23 July 2024.
  2. ^ Collet, Yann. "LZ4 Frame Format Description". GitHub. Retrieved 7 October 2020.
  3. ^ Michael Larabel (28 January 2013). "Support For Compressing The Linux Kernel With LZ4". Phoronix. Retrieved 28 August 2015.
  4. ^ Collet, Yann (30 March 2019). "LZ4 Block Format Description". GitHub. Retrieved 9 July 2020. There is no entropy encoder back-end nor framing layer.
  5. ^ DEFLATE Compressed Data Format Specification version 1.3. IETF. doi:10.17487/RFC1951. RFC 1951. Retrieved 9 July 2020.
  6. ^ Yann Collet (26 May 2011). "RealTime Data Compression". Retrieved 28 August 2015.
  7. ^ ticki (25 October 2016). "How LZ4 works". Retrieved 29 June 2017.
  8. ^ "lz4/doc/lz4_Frame_format.md at dev · lz4/lz4". GitHub.
  9. ^ "LZ4 Frame Format Description".
  10. ^ Extremely Fast Compression algorithm http://www.lz4.org on GitHub
  11. ^ Jonathan Corbet (19 July 2013). "Kernel development". LWN.net. Retrieved 28 August 2015.
  12. ^ "FreeBSD 9.2-RELEASE Release Notes". FreeBSD. 13 November 2013. Retrieved 28 August 2015.
  13. ^ "LZ4 Compression". illumos. Archived from the original on 9 October 2018. Retrieved 28 August 2015.
  14. ^ Illumos #3035 LZ4 compression support in ZFS and GRUB on GitHub
  15. ^ "Features: lz4 compression". OpenZFS. Retrieved 28 August 2015.
  16. ^ Phillip Lougher (27 November 2014). "Squashfs: Add LZ4 compression configuration option". Retrieved 28 August 2015.
  17. ^ 7-zip-zstd

External links

[edit]
  • Official website Edit this at Wikidata
  • v
  • t
  • e
Data compression methods
Lossless
type
Entropy
  • Adaptive coding
  • Arithmetic
  • Asymmetric numeral systems
  • Golomb
  • Huffman
    • Adaptive
    • Canonical
    • Modified
  • Range
  • Shannon
  • Shannon–Fano
  • Shannon–Fano–Elias
  • Tunstall
  • Unary
  • Universal
    • Exp-Golomb
    • Fibonacci
    • Gamma
    • Levenshtein
Dictionary
  • Byte-pair encoding
  • Lempel–Ziv
    • 842
    • LZ4
    • LZJB
    • LZO
    • LZRW
    • LZSS
    • LZW
    • LZWL
    • Snappy
Other
  • BWT
  • CTW
  • CM
  • Delta
    • Incremental
  • DMC
  • DPCM
  • Grammar
    • Re-Pair
    • Sequitur
  • LDCT
  • MTF
  • PAQ
  • PPM
  • RLE
Hybrid
  • LZ77 + Huffman
    • Deflate
    • LZX
    • LZS
  • LZ77 + ANS
    • LZFSE
  • LZ77 + Huffman + ANS
    • Zstandard
  • LZ77 + Huffman + context
    • Brotli
  • LZSS + Huffman
    • LHA/LZH
  • LZ77 + Range
    • LZMA
    • LZHAM
  • RLE + BWT + MTF + Huffman
    • bzip2
Lossy
type
Transform
  • Discrete cosine transform
    • DCT
    • MDCT
  • DST
  • FFT
  • Wavelet
    • Daubechies
    • DWT
    • SPIHT
Predictive
  • DPCM
    • ADPCM
  • LPC
    • ACELP
    • CELP
    • LAR
    • LSP
    • WLPC
  • Motion
    • Compensation
    • Estimation
    • Vector
  • Psychoacoustic
Audio
Concepts
  • Bit rate
    • ABR
    • CBR
    • VBR
  • Companding
  • Convolution
  • Dynamic range
  • Latency
  • Nyquist–Shannon theorem
  • Sampling
  • Silence compression
  • Sound quality
  • Speech coding
  • Sub-band coding
Codec
parts
  • A-law
  • μ-law
  • DPCM
    • ADPCM
    • DM
  • FT
    • FFT
  • LPC
    • ACELP
    • CELP
    • LAR
    • LSP
    • WLPC
  • MDCT
  • Psychoacoustic model
Image
Concepts
  • Chroma subsampling
  • Coding tree unit
  • Color space
  • Compression artifact
  • Image resolution
  • Macroblock
  • Pixel
  • PSNR
  • Quantization
  • Standard test image
  • Texture compression
Methods
  • Chain code
  • DCT
  • Deflate
  • Fractal
  • KLT
  • LP
  • RLE
  • Wavelet
    • Daubechies
    • DWT
    • EZW
    • SPIHT
Video
Concepts
  • Bit rate
    • ABR
    • CBR
    • VBR
  • Display resolution
  • Frame
  • Frame rate
  • Frame types
  • Interlace
  • Video characteristics
  • Video quality
Codec
parts
  • DCT
  • DPCM
  • Deblocking filter
  • Lapped transform
  • Motion
    • Compensation
    • Estimation
    • Vector
  • Wavelet
    • Daubechies
    • DWT
Theory
  • Compressed data structures
    • Compressed suffix array
    • FM-index
  • Entropy
  • Information theory
    • Timeline
  • Kolmogorov complexity
  • Prefix code
  • Quantization
  • Rate–distortion
  • Redundancy
  • Symmetry
  • Smallest grammar problem
Community
  • Hutter Prize
People
  • Mark Adler
  • David A. Huffman
  • Phil Katz
  • v
  • t
  • e
Archive formats
Archiving only
  • ar
  • cpio
  • shar
  • tar
  • LBR
  • WAD
  • WARC
Compressing only
  • Brotli
  • bzip2
  • compress
  • gzip
  • Zopfli
  • LZMA
  • LZ4
  • lzip
  • lzop
  • SQ
  • xz
  • Zstandard
  • PAQ
Archiving
and compressing
  • 7z
  • ACE
  • ARC
  • ARJ
  • B1
  • Cabinet
  • cfs
  • cpt
  • dar
  • DGCA
  • .dmg
  • .egg
  • kgb
  • LHA
  • lrzip
  • LZX
  • MPQ
  • PEA
  • RAR
  • rzip
  • sit
    • sitx
  • SQX
  • UDA
  • Xar
  • zoo
  • ZIP
  • ZPAQ
Software packaging
and distributing
  • apk
  • App
  • APPX
  • deb
  • HAP
  • ipa
  • JAR
    • WAR
    • Jakarta EE RAR
    • EAR
  • MSI
  • MSIX
  • Package (macOS)
  • RPM
  • XAP
  • XBAP
Document packaging
and distributing
  • OEB Package Format
  • OEBPS Container Format
  • Open Packaging Conventions
  • Comparison
  • List
  • Category
  • v
  • t
  • e
Data compression software
Archivers with
compression
(comparison)
Free and
open-source
  • 7-Zip
  • Ark
  • Expander
  • File Roller
  • FreeArc
  • Info-ZIP
  • KGB Archiver
  • PAQ
  • pax
  • PeaZip
  • XAD (decompression only)
  • Xarchiver
  • Zipeg
  • ZPAQ
Freeware
  • Filzip
  • LHA
  • StuffIt Expander (decompression only)
  • The Unarchiver (decompression only)
  • TUGZip
  • ZipGenius
Commercial
  • ARC
  • ALZip
  • Archive Utility
  • ARJ
  • BetterZip
  • MacBinary
  • PKZIP/SecureZIP
  • PowerArchiver
  • StuffIt
  • WinAce
  • WinRAR
  • WinZip
Non-archiving
compressors
Generic
  • bzip2
  • compress
  • gzip
  • lzip
  • lzop
  • pack
  • rzip
  • Snappy
  • XZ Utils
  • zstd
For code
UPX
Audio
compression

(comparison)
Lossy
  • AAC
    • Fraunhofer FDK AAC
    • Nero AAC Codec
    • FAAC
  • Helix DNA Producer
  • MP3
    • l3enc
    • LAME
  • TooLAME
  • libavcodec
  • libcelt
  • libopus
  • libspeex
  • Musepack
  • libvorbis
  • Windows Media Encoder
Lossless
  • ALAC
  • FLAC
  • libavcodec
  • Monkey's Audio
  • mp4als
  • OptimFROG
  • Shorten
  • WavPack
Video
compression

(comparison)
Lossy
MPEG-4 ASP
  • 3ivx
  • DivX
  • Nero Digital
  • FFmpeg
  • HDX4
  • Xvid
H.264
  • CoreAVC
  • Blu-code
  • DivX
  • FFmpeg
  • Nero Digital
  • OpenH264
  • QuickTime
  • x264
HEVC
  • DivX
  • x265
Others
  • CineForm
  • Cinepak
  • Daala
  • DNxHD
  • Helix DNA Producer
  • Indeo
  • libavcodec
  • Schrödinger (Dirac)
  • SBC
  • Sorenson
  • VP7
  • libtheora
  • libvpx
  • Windows Media Encoder
Lossless
  • FFV1
  • Huffyuv
  • Lagarith
  • MSU Lossless
  • YULS
  • See also: compression methods and compression formats
Retrieved from "https://teknopedia.ac.id/w/index.php?title=LZ4_(compression_algorithm)&oldid=1338697461"
Categories:
  • Lossless compression algorithms
  • Free data compression software
  • C (programming language) libraries
  • Data compression
Hidden categories:
  • Articles with short description
  • Short description is different from Wikidata
  • Use dmy dates from January 2021

  • indonesia
  • Polski
  • العربية
  • Deutsch
  • English
  • Español
  • Français
  • Italiano
  • مصرى
  • Nederlands
  • 日本語
  • Português
  • Sinugboanong Binisaya
  • Svenska
  • Українська
  • Tiếng Việt
  • Winaray
  • 中文
  • Русский
Sunting pranala
url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url
Pusat Layanan

UNIVERSITAS TEKNOKRAT INDONESIA | ASEAN's Best Private University
Jl. ZA. Pagar Alam No.9 -11, Labuhan Ratu, Kec. Kedaton, Kota Bandar Lampung, Lampung 35132
Phone: (0721) 702022
Email: pmb@teknokrat.ac.id