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
-
Generalization of Fibonacci Codes to the Non-Binary Case
by: Shmuel T. Klein, et al.
Published: (2022-01-01) -
Compressed Matching in Dictionaries
by: Shmuel T. Klein, et al.
Published: (2011-03-01) -
Impact of Compression and Small Cell Deployment on NB-IoT Devices Coverage and Energy Consumption with a Realistic Simulation Model
by: Mehdi Zeinali, et al.
Published: (2021-09-01) -
Using Probabilistic Models for Data Compression
by: Iuliana Iatan, et al.
Published: (2022-10-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)