-
带汉明码的直接序列变换DSSS，直接序列变化中采用了hamm编码方式，带GUI...
带汉明码的直接序列变换DSSS，直接序列变化中采用了hamm编码方式，带GUI-Hamming codes with the direct-sequence transform DSSS direct sequence changes hamm used in the encoding, with GUI
- 2022-02-05 07:36:50下载
- 积分：1
-
agreement h261 coding yards inside lib_261.h provided a detailed interface and a...
h261协议的h261编码码,lib_261.h里面提供了详细的接口和说明.-agreement h261 coding yards inside lib_261.h provided a detailed interface and annotations.
- 2022-07-01 22:46:26下载
- 积分：1
-
JPEG2000的要求和配置文件版本6.3
JPEG2000 requirements and profiles version 6.3
- 2022-04-20 03:16:48下载
- 积分：1
-
这是个usos的源码，呵呵，上传上来供大家学习之用。
这是个usos的源码，呵呵，上传上来供大家学习之用。-This is a usos source, huh, huh, upload up for everyone learning.
- 2022-08-19 18:51:19下载
- 积分：1
-
模拟了双周期光栅的衍射情况，给出了衍射图象
模拟了双周期光栅的衍射情况，给出了衍射图象-Simulation of a dual-cycle of the diffraction grating, the diffraction image is given
- 2022-02-11 17:49:19下载
- 积分：1
-
我在做项目的时候需要将文件进行压缩和解压缩，于是就从http://www.icsharpcode.net下载了关于压缩和解压缩的源码，但是下载下来后，面对这么多...
我在做项目的时候需要将文件进行压缩和解压缩，于是就从http://www.icsharpcode.net下载了关于压缩和解压缩的源码，但是下载下来后，面对这么多的代码，一时不知如何下手。只好耐下心来，慢慢的研究，总算找到了门路。针对自己的需要改写了文件压缩和解压缩的两个类，分别为ZipClass和UnZipClass。其中碰到了不少困难，就决定写出来压缩和解压的程序后，一定把源码贴出来共享，让首次接触压缩和解压缩的朋友可以少走些弯路。-When I was doing the project will need to compress and decompress files, so downloading from http://www.icsharpcode.net on the compression and decompression of the source code, but it downloaded, and faced with so many code, 1:00 do not know how start with. Had under-resistant heart, the slow research and finally found the avenues. In light of their need to be rewritten a file compression and decompression of the two classes, namely ZipClass and UnZipClass. Which encountered many difficulties, it was decided to write out compression and decompression process, some paste out of the source code sharing, so that the first contact with compression and decompression of friends can take some less roundabout.
- 2022-08-25 01:14:36下载
- 积分：1
-
THE JPEG2000 STILLIMAGE CODING SYSTEM
THE JPEG2000 STILLIMAGE CODING SYSTEM
- 2022-01-26 05:43:29下载
- 积分：1
-
C＋＋类实现LZW 压缩算法
C＋＋类实现LZW 压缩算法-C++ classes to achieve LZW compression algorithm
- 2022-02-16 07:10:55下载
- 积分：1
-
在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！
1、构造范式 Huffman 编码的方法大致...
在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！
1、构造范式 Huffman 编码的方法大致是：
分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如，编码长度为 5 的符号有 4 个，长度为 3 的有 1 个，长度为 2 的有 3 个，则分配的编码依次为： 00000 00001 00010 00011 001 01 10 11
问题：如果按照这种说法那么我在一付图像中渡到的数据是：编码长度为 6 的符号有 1 个，长度为 5 的有 1 个，长度为 4 的有 3 个，长度为3的个数为4个，长度为2的个数为1个。按照以上的算法得到的编码为：000000；00001；0010；0011；001；010；011；100；01。出现001是0011的前缀。在读取数据流的时候将不能区别。
2、另外一种说法，曾经发帖问过。前面的长度编码加1左移一位得到后面长度的编码。像我这个例子如何确定最短码的起始值？
谢谢大家指点具体的范式Huffman编码实现-in which Huffman is the paradigm Huffman coding. After investigations related information in two different arguments, please master guiding. Thank you! 1, tectonic paradigm Huffman coding method is generally : statistics separately from the largest maxlength length coding to a length corresponding to each of the number of symbols. According to the information from maxlength-0 progressive order of the distribution of each symbol coding. For example,
- 2023-08-31 17:35:03下载
- 积分：1
-
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is d...
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
- 2022-10-29 01:55:05下载
- 积分：1
