jpeg2000编码器,仅供参考，haha hahahahha

动态规划的算法实例，包括具体的例子和注释，很详细-Examples of dynamic programming algorithms, including specific examples and notes, very detailed

通过对键盘的编程，实验对键值的读取，实现计算器的功能，并将结果在数码管上显示。-Programming through the keyboard, the key test of reading, realize the functions of the calculator and the results in the digital tube display.

自适应的哈夫曼编码程序，包括屏幕输出和文件保存。-Adaptive Huffman Coding procedures, including the screen output and save the file.

有关树的遍历问题-the tree traversal issue

faac-1.25.rar音频编解码器demo-faac-1.25.rar audio codec demo

方便处理JPEG格式图片的基于VC的源代码-facilitate the processing of JPEG images based on the source code VC

本文介绍UVLC编解码,提供源代码.测试成功-This article describes UVLC codec, providing the source code. Test success

ZPAV (H265) pnxNNNN(PHILIPS) demo ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4， ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，...... -ZPAV (H265) pnxNNNN (PHILIPS) demo ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV ( H265) is the audio and video compression decompression agreements, very different from the H264/MPEG4, ZPAV (H265) the basic algorithm is a wavelet, multi-level tree collection groups, generalized wavelets, mathematical morphology wavelet ,......

霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.

经过DCT变换用 LZW进行数据压缩 再还原回来-After DCT transform data using LZW compression and then restored back