- AD MC9S08DZ60 转换 并且能够用数码管显示 八位C 转换
- fuzzy-rules 主要是学习模糊规则的基本原理
- sy1PLD 简易的霹雳灯 流水灯 包含按键 简单的花式 含protues仿真 keil编译
- svc-57-bus placement of svc in 57 bus IEEE system
- sin_cos_module Verilog实现的cordic算法的计算sin
- stm32-lwip 面向STM32F4x7微控制器的LwIP TCPIP协议栈的演示代码(The demo code of the LwIP TCPIP protocol stack facing STM32F4x7 Microcontrollers)
文件名称:Huffman_coding_(Java)
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:2.44kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols occur more frequently than others and by shortening the code for that symbol, space can be saved. There are other interesting properties of Huffman codes as well as some gotchas with respect to their use, so the above link is worth reading.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Hufftree.java
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.