We address the compression efficiency of feedback-free and hash-check distributed video coding

which generates and transmits a hash code of a source information sequence. The hash code helps the decoder perform a motion search. A hash collision is a special case in which the hash codes of wrongly reconstructed information sequences occasionally match the hash code of the source information sequence. This deteriorates the quality of the decoded image greatly. In this paper

the statistics of hash collision are analyzed to help the codec select the optimal trade-off between the probability of hash collision and the length of the hash code

according to the principle of rate-distortion optimization. Furthermore

two novel algorithms are proposed: (1) the nonzero prefix of coefficients (NPC)

which indicates the count of nonzero coefficients of each block for the second algorithm

and also saves 8.4% bitrate independently; (2) the adaptive selection of hash functions (AHF)

which is based on the NPC and saves a further 2%

–

6% bitrate on average. The detailed optimization of the parameters of AHF is also presented.