In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
标签： algorithm character position either
上传时间： 2014-01-27
上传用户：wang0123456789
在程序中由playfair(char *s,int length) 的实现加密和解密；解密原理与加密类似，只是加密过程的逆过程，它基于密文，采用同行取左边，同列取下边，其余取交叉的相反原理；在程序中用FLAG标识区别，当其值为1时，为加密过程；值为0时，为解密过程。
上传时间： 2014-01-25
上传用户：busterman
* * Input * bin_data : binary data * bin_size : binary data length * Mode : operation mode * BASE64_NeedCRLF ---- Need a CRLF every 64 base64-character * BASE64_NotCRLF ---- Need not CRLF between 64 base64-character * * Output * char data * char data length * * Return * 0: success -1: error
标签： binary data operation bin_data
上传时间： 2015-06-04
上传用户：ZJX5201314
The Reed-Somolon code is specified by the finite field, the length (length <= 2^m-1), the number of redundant symbols (length-k), and the initial zero of the code, init_zero, such that the zeros are: init_zero, init_zero+1, ..., init_zero+length-k-1
标签： length the Reed-Somolon specified
上传时间： 2014-07-31
上传用户：skfreeman
工程计算MATLAB code to calculate the reorthogonalized sine tapers input: N = the length of the time series data to be tapered p = the number of tapers requested I = the gap structure a vector of length N I(t) = 1 if there is data at time t, t=1, ..., N I(t) = 0 if there is a gap at time t output: X = N-by-p vector of the reorthogonalized sine taper
标签： the reorthogonalized calculate MATLAB
上传时间： 2013-12-17
上传用户：wangyi39
This example shows how to transmit and receive packets with packet length up to 255 bytes. The status byte is polled every 200 us in a timer1 int.
标签： transmit example receive packets
上传时间： 2014-01-26
上传用户：zhuimenghuadie
1.JPEG压缩编码的vc++代码 2.使用Run length algorithm Jpeg图像编解码 3.内含有测试用c,rc,h,文件，测试用图像文件，翔实，清晰的代码注释行
标签： algorithm length JPEG Jpeg
上传时间： 2015-08-16
上传用户：zhengjian
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
标签： symbols length Hard-decision Codeword
上传时间： 2014-07-08
上传用户：曹云鹏
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
标签： WoodenSticks Description length wooden
上传时间： 2014-03-08
上传用户：netwolf
實現基本的資料壓縮演算法的參考,以run-length編碼的的演算法機制,所得出的源碼
标签： run-length 算法
上传时间： 2015-10-20
上传用户：gundamwzc
