Through the analysis of the UVLC, a quotient-residue variable lengh coding scheme is proposed which conforms to the distribution of the syntax value in real video coding and its average code length is shorter. Through the real test, its coding efficiency is higher than that in the standard.

A novel method is produced by utilizing MOCPM in ABAC,which is more effective than traditional methods. It enables to shorten average code length and makes the coded symbol almost its entropy rate,so a notable improvement is achieved in the data compression of binary arithmetic coding. The data compression ratio can be as high as 90 %.

Through the analysis of the UVLC, a quotient-residue variable lengh coding scheme is proposed which conforms to the distribution of the syntax value in real video coding and its average code length is shorter. Through the real test, its coding efficiency is higher than that in the standard.

A novel method is produced by utilizing MOCPM in ABAC,which is more effective than traditional methods. It enables to shorten average code length and makes the coded symbol almost its entropy rate,so a notable improvement is achieved in the data compression of binary arithmetic coding. The data compression ratio can be as high as 90 %.

The average code length c is defined by c=\sumi=1n pi li .

In the first and second method the average code length found after application of the Huffmann encoding has been found to be about 4 bits sample-1.

Moreover, this best code can be modified to ensure that the almost sure version of the code length has asymptotically the same behavior as its expected value, i.e., the average code length.

Secondly, we deal with the problem: what is the "best" achievable average code length with underlying density functionf? Minimax lower bounds are derived for the average code length over certain smooth classes of underlying densitiesf.

Without encryption, the average code length for encoding DCs is 5.78 bits.

The paper describes a real-time lossless data compression algorithm for both individual band and multi-spectral remote sensing images. This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length. Several kinds of predictions were studied and the 2-D prediction was selected. Some simplifications were taken in the Huffman coding for real-time use. A comparison between the coding methods was discussed. The scheme was applied to the 8 bits/pixel, original...

The paper describes a real-time lossless data compression algorithm for both individual band and multi-spectral remote sensing images. This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length. Several kinds of predictions were studied and the 2-D prediction was selected. Some simplifications were taken in the Huffman coding for real-time use. A comparison between the coding methods was discussed. The scheme was applied to the 8 bits/pixel, original images of LANDSAT TM, SPOT HRV, AIR SAR and imaging spectrometer by software emulation. An average compression ratio of 2, with the highest value of 3.1 and the lowest value of 1.2 for the radar images, was achieved.

A novel construction algorithm for symmetrical Reversible Variable Length Codes(RVLC) is proposed based on the analysis of the symmetrical RVLC code tree,which is independent of the Huffman code.The algorithm adds all candidate codes into the queue after the minimum codeword length is obtained according to the symbol probability,then selects those which satisfy the codeword mechanism as symmetrical RVLCs.The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword...

A novel construction algorithm for symmetrical Reversible Variable Length Codes(RVLC) is proposed based on the analysis of the symmetrical RVLC code tree,which is independent of the Huffman code.The algorithm adds all candidate codes into the queue after the minimum codeword length is obtained according to the symbol probability,then selects those which satisfy the codeword mechanism as symmetrical RVLCs.The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword selection mechanism and easy realization.

The analysis of error resiliency of variable length codes(VLC) by Discrete Memoryless Source model is proposed.The probability of error resiliency was counted at the time when the appearing probability of one codeword in the code sequence at a fixed time and the transition probability from this codeword to other codeword with same codeword length to this codeword were analyzed.The error resiliency probability of whole code sequence is the code sequence length power of this transition probability.The simulation...

The analysis of error resiliency of variable length codes(VLC) by Discrete Memoryless Source model is proposed.The probability of error resiliency was counted at the time when the appearing probability of one codeword in the code sequence at a fixed time and the transition probability from this codeword to other codeword with same codeword length to this codeword were analyzed.The error resiliency probability of whole code sequence is the code sequence length power of this transition probability.The simulation results show that the VLC with best error resiliency could be picked out in the VLCs which possesses the same average code length and codeword variance by the method.