An Efficient VLC for Lossless Data Compression: Leveling
DOI:
https://doi.org/10.9734/bpi/ctmcs/v10/4169FKeywords:
Entropy coding, Huffman encoding, leveling, lossless data compression, meaning, VLCAbstract
Many standard compression methods are based, at their most basic level, on coding digital words of variable length, or VLC, Huffman type, designed in 1952, or any of its variants, as canonical. This article describes a VLC called "Leveling" that is more efficient than Huffman encoding and employs two variants: "Leveled Reordering" for low redundancy, such as text, and "Segmented Leveling" for moderate and high redundancy, such as image processing. Leveling, invented by Javier Joglar in 1995, employs the notions of "meaning" and "ordering" of the VLC codes generated to achieve the highest "compression ratio" of any non-adaptive VLC.
Published
2021-08-30
How to Cite
Javier Joglar Alcubilla. (2021). An Efficient VLC for Lossless Data Compression: Leveling. Current Topics on Mathematics and Computer Science Vol. 10, 1–25. https://doi.org/10.9734/bpi/ctmcs/v10/4169F
Issue
Section
Chapters