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
<li id="8c8sc"></li>