POJ 1521 Entropy（哈夫曼Huffman编码）

最新推荐文章于 2021-02-21 00:32:12 发布

da_kao_la

最新推荐文章于 2021-02-21 00:32:12 发布

阅读量392

点赞数

分类专栏：百练OJ/poj 文章标签： poj Cpp Huffman编码优先队列

本文链接：https://blog.csdn.net/da_kao_la/article/details/81080691

版权

本文介绍了熵编码的概念，通过去除消息中的冗余信息实现无损数据压缩。以ASCII编码的英文文本为例，探讨了如何使用前缀自由可变长度编码进行更高效的数据编码。并举例说明了如何为常见字母分配不同长度的编码，从而达到压缩效果。同时，提供了POJ 1521问题的解决方案，利用最小优先队列模拟实现哈夫曼编码长度的计算，强调了当字符串中只有一种字符时的特殊情况处理。

摘要由CSDN通过智能技术生成

题目来源：http://poj.org/problem?id=1521

Entropy

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 9899		Accepted: 3637

Description

An entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with "wasted" or "extra" information removed. In other words, entropy encoding removes information that was not necessary in the first place to accurately encode the message. A high degree of entropy implies a message with a great deal of wasted information; english text encoded in ASCII is an example of a message type that has very high entropy. Already compressed messages, such as JPEG graphics or ZIP archives, have very little entropy and do not benefit from further attempts at entropy encoding.

English text encoded in ASCII has a high degree of entropy because all characters are encoded using the same number of bits, eight. It is a known fact that the letters E, L, N, R, S and T occur at a considerably higher frequency than do most other letters in english text. If a way could be found to encode just these letters with four bits, then the new encoding would be smaller, would contain all the origi