Using Probabilistic Models for Data Compression
Our research objective is to improve the Huffman coding efficiency by adjusting the data using a Poisson distribution, which avoids the undefined entropies too. The scientific value added by our paper consists in the fact of minimizing the average length of the code words, which is greater in the ab...
Main Authors: | Iuliana Iatan, Mihăiţă Drăgan, Silvia Dedu, Vasile Preda |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/20/3847 |
Similar Items
-
On the Randomness of Compressed Data
by: Shmuel T. Klein, et al.
Published: (2020-04-01) -
Generalization of Fibonacci Codes to the Non-Binary Case
by: Shmuel T. Klein, et al.
Published: (2022-01-01) -
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
by: Ian Blanes, et al.
Published: (2019-01-01) -
A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming
by: Julián Moreno Cadavid, et al.
Published: (2021-03-01) -
Hiding Data Using Efficient Combination of RSA Cryptography, and Compression Steganography Techniques
by: Osama Fouad Abdel Wahab, et al.
Published: (2021-01-01)