登录
首页 » Java » huff

huff

于 2013-05-26 发布 文件大小:7KB
0 270
下载积分: 1 下载次数: 4

代码说明:

  呃,就是用赫夫曼算法写的压缩解压程序。非常粗糙,只能压缩英文文章。因为里面的字符概率是基于自然语言的,源代码之类的没法压缩。而且会抛弃最后几个字母,嘿嘿。为了交作业,没有好好写。改一下下应该能挺好的。压缩比能到60 吧(Uh, is to use Huffman compression decompression algorithm written procedures. Very rough, only compress English articles. Because there is the probability of characters based on natural language, the source code and the like can not compressed. And will abandon the last few letters, hehe. For homework, not properly written. The following should be able to change it quite good. Compression ratio to 60 of it can be)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Huffman_code
    实现Huffman算法,对数据进行最优编码压缩。(huffman code)
    2016-01-22 09:27:03下载
    积分:1
  • Compressed-Sensing
    压缩感知的经典书籍,请大家下载查阅,好的东西大家一起分享哦,谢谢大家了!!(compresed sensoring)
    2020-12-31 10:18:59下载
    积分:1
  • 3D-Imaging-with-Compressive-Sensing
    压缩感知三维成像文献,是三维重建方面最新的文献(Compressed sensing three-dimensional imaging literature, is the latest three-dimensional reconstruction of the literature)
    2013-11-23 22:16:15下载
    积分:1
  • DCT_2D
    二维DCT,FPGA实现JPEG压缩中的二维DCT(dct)
    2020-12-02 18:39:25下载
    积分:1
  • yasuojieya
    本代码为LZW算法的C语言实现程序,他在此基础上加入了霍夫曼算法的优点(the LZW algorithm code for the C language procedure, he joined the basis of the merits of the algorithm Hoffman)
    2005-04-17 14:15:08下载
    积分:1
  • ffmpeg-0.4.9-p20060530.tar.tar
    ffmpeg 是一个开源、功能强大的多媒体处理软件,可以实现对音频流、视频流的录制和转换。(ffmpeg is an open source, powerful multimedia processing software, which enables audio streaming, video streaming recording and conversion.)
    2009-10-22 18:33:03下载
    积分:1
  • cccc
    输入两个正整数m和n,求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)
    2010-05-11 21:19:20下载
    积分:1
  • SVD_on_Matlab
    SVD algorithm implementation in Matlab
    2020-07-17 14:28:50下载
    积分:1
  • GaTspInMatlab
    说明:  TSP 程序 ,有Matlab GUI界面,完常直观,很有学习价值。(TSP programs with GUI base on GA,it s worth downloading)
    2010-04-09 08:00:51下载
    积分:1
  • Traversalalgo
    Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
    2009-12-01 04:47:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载