A fast and simple algorithm for the construction of asymmetrical reversible variable length codes

Authors:
Hsien-Wen Tseng;Chin-Chen Chang
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan, ROC;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan, ROC
Venue:
Real-Time Imaging
Year:
2003

Citing 3
Cited 1

Algorithms from P to NP (vol. 1): design and efficiency

Algorithms from P to NP (vol. 1): design and efficiency
Source/channel coding using reversible self-synchronizing variable-length codes

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05
Modified symmetrical reversible variable-length code and its theoretical bounds

IEEE Transactions on Information Theory

Error resilient locally adaptive data compression

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reversible variable length codes (RVLCs) have been used to enhance the error-resilient capability of variable length codes (VLCs). A fast and simple new algorithm that can be used to construct asymmetrical RVLCs is to be proposed here. It generates asymmetrical RVLCs by means of extending the leaf nodes of the Huffman tree. The proposed algorithm proves to be extremely efficient and fast; meanwhile, the maximum code length provided by the proposed algorithm is shorter than those of previous methods. Our new algorithm can apply to any Huffman-based coding scheme to enhance the error-resilient capability, especially when the applications are time-critical, such as wireless systems. The experimental results have shown that our algorithm can generate asymmetrical RVLCs efficiently.