虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

您现在的位置是:虫虫下载站 > 资源下载 > 压缩解压 > ) Compression using huffman code -with a number of bits k per code word -provide huffma

) Compression using huffman code -with a number of bits k per code word -provide huffma

  • 资源大小:2 K
  • 上传时间: 2017-05-30
  • 上传用户:angela5683
  • 资源积分:2 下载积分
  • 标      签: code Compression huffman provide

资 源 简 介

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.

相 关 资 源

您 可 能 感 兴 趣 的