Abstract
The synchronization recovery property of variable-length (VL) codes has been extensively studied. In the paper, the mean error propagation length (MEPL) and the variance of error propagation length (VEPL), which are the secondary performance criteria of a VL code, are introduced to measure the synchronization recovery capability of a VL code. For the same probability distribution, there exist many different VL codes which have the same redundancy as the Huffman code but quite different MEPLs and VEPLs. To find one of the VL codes which has the minimum MEPL is a very difficult problem. We present two design algorithms for finding minimum-redundancy VL codes with short MEPL and VEPL. These two algorithms are simple and have the property that the codewords are assigned one by one. The efficiency of the algorithms are tested extensively by comparing the algorithms with known construction methods available in literature. Actually, VL codes obtained by the two algorithms outperform almost all codes available.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call