On the Randomness of Compressed Data
It seems reasonable to expect from a good compression method that its output should not be further compressible, because it should behave essentially like random data. We investigate this premise for a variety of known lossless compression techniques, and find that, surprisingly, there is much varia...
Main Authors: | Shmuel T. Klein, Dana Shapira |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-04-01
|
Series: | Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2078-2489/11/4/196 |
Similar Items
-
Compressed Matching in Dictionaries
by: Shmuel T. Klein, et al.
Published: (2011-03-01) -
The Average Coding Length of Huffman Coding Based Signal Processing and Its Application in Fault Severity Recognition
by: Jiancheng Yin, et al.
Published: (2019-11-01) -
Comparison of Entropy and Dictionary Based Text Compression in English, German, French, Italian, Czech, Hungarian, Finnish, and Croatian
by: Matea Ignatoski, et al.
Published: (2020-07-01) -
Μελέτη και υλοποίηση αλγορίθμων συμπίεσης
by: Γρίβας, Απόστολος
Published: (2011) -
An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression
by: Erdal Erdal, et al.
Published: (2019-02-01)