登录
首页 » Visual C++ » SHANNON.ZIP

SHANNON.ZIP

于 2012-12-21 发布 文件大小:142KB
0 218
下载积分: 1 下载次数: 2

代码说明:

  香农编码的C++实现。原理说明以及源代码。(The Shannon coding C++. Principle of instructions and source code.)

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

发表评论

0 个回复

  • MCAB
    简单易用的制作压缩包软件,原著老毛桃。使用简单,压缩时间快(easy to use for make cab)
    2013-10-14 16:30:06下载
    积分:1
  • VC_programming_LZARI_classic_code_compression_algo
    VC编程实现LZARI压缩算法经典代码VC programming LZARI classic code compression algorithm (VC programming LZARI classic code compression algorithm )
    2010-09-09 11:25:30下载
    积分:1
  • Compressed-Sensing
    压缩感知的经典书籍,请大家下载查阅,好的东西大家一起分享哦,谢谢大家了!!(compresed sensoring)
    2020-12-31 10:18:59下载
    积分:1
  • huffman
    huffman 编码 完陈对指定的文本文件内容进行huffman编码 实现输出(END CHAN huffman encoding text file on the specified content encoding huffman implementation output)
    2009-04-03 13:04:43下载
    积分:1
  • HAFUMANSHU
    哈夫曼编码(Huffman Coding),又称霍夫曼编码,是一种编码方式,哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法,该方法完全依据字符出现概率来构造异字头的平均长度最短的码字,有时称之为最佳编码,一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)
    2016-12-13 00:02:52下载
    积分:1
  • haffman
    对输入的字符进行哈弗曼编码,生成编码表,计算压缩比等(haffman tree)
    2011-08-30 14:10:52下载
    积分:1
  • reliability-assessment
    电力输发电系统可靠性评估程序 解析法 系统数据在压缩包里(Power transmission and generation system reliability evaluation process analytical method system data compression bag)
    2020-09-01 09:28:09下载
    积分:1
  • HuffMan
    哈夫曼编码译码系统,设置发送者和接受者两个功能, 发送者的功能包括: ①输入待传送的字符信息; ②统计字符信息中出现的字符种类数和各字符出现的次数(频率); ②根据字符的种类数和各自出现的次数建立哈夫曼树; ③利用以上哈夫曼树求出各字符的哈夫曼编码; ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括: ①接收发送者传送来的编码信息; ②利用上述哈夫曼树对编码信息进行翻译,即将编码信息还原成发送前的字符信息。 (Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)
    2012-06-21 21:01:17下载
    积分:1
  • PhucDo_PhanLop
    Docuemtns,Hot Documents
    2009-12-26 14:25:16下载
    积分:1
  • youmohoudu
    不可压缩稳态滑块润滑,一定长度的变间隙油膜厚度解析(Incompressible variable gap steady slide lubrication film thickness resolve certain length)
    2015-10-28 10:28:17下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载